Base | Representation |
---|---|
bin | 11101110011010110… |
… | …010100100001001010 |
3 | 10001121010122112111210 |
4 | 131303112110201022 |
5 | 1011014000031442 |
6 | 22411155033550 |
7 | 2211663346554 |
oct | 356326244112 |
9 | 101533575453 |
10 | 32000002122 |
11 | 12631192250 |
12 | 625089b8b6 |
13 | 302c8403ca |
14 | 1797d044d4 |
15 | c744dc19c |
hex | 77359484a |
32000002122 has 128 divisors (see below), whose sum is σ = 78805094400. Its totient is φ = 8536320000.
The previous prime is 32000002117. The next prime is 32000002129. The reversal of 32000002122 is 22120000023.
It is a junction number, because it is equal to n+sod(n) for n = 32000002098 and 32000002107.
It is not an unprimeable number, because it can be changed into a prime (32000002129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1674622 + ... + 1693622.
It is an arithmetic number, because the mean of its divisors is an integer number (615664800).
Almost surely, 232000002122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32000002122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39402547200).
32000002122 is an abundant number, since it is smaller than the sum of its proper divisors (46805092278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32000002122 is a wasteful number, since it uses less digits than its factorization.
32000002122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19132.
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 32000002122 its reverse (22120000023), we get a palindrome (54120002145).
The spelling of 32000002122 in words is "thirty-two billion, two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •