Base | Representation |
---|---|
bin | 101111000010011001… |
… | …0111110001000010000 |
3 | 100122201201021112100200 |
4 | 1132010302332020100 |
5 | 3123333110431000 |
6 | 114223202015200 |
7 | 10204114356513 |
oct | 1360462761020 |
9 | 318651245320 |
10 | 101012202000 |
11 | 39925833486 |
12 | 176b0947500 |
13 | 96aa42c838 |
14 | 4c63666d7a |
15 | 296302b500 |
hex | 1784cbe210 |
101012202000 has 120 divisors (see below), whose sum is σ = 352802013720. Its totient is φ = 26936582400.
The previous prime is 101012201887. The next prime is 101012202017. The reversal of 101012202000 is 202210101.
It can be written as a sum of positive squares in 4 ways, for example, as 2225197584 + 98787004416 = 47172^2 + 314304^2 .
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2787895 + ... + 2823894.
It is an arithmetic number, because the mean of its divisors is an integer number (2940016781).
Almost surely, 2101012202000 is an apocalyptic number.
101012202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101012202000 is an abundant number, since it is smaller than the sum of its proper divisors (251789811720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012202000 is a wasteful number, since it uses less digits than its factorization.
101012202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5611818 (or 5611799 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 101012202000 its reverse (202210101), we get a palindrome (101214412101).
The spelling of 101012202000 in words is "one hundred one billion, twelve million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •