Base | Representation |
---|---|
bin | 100100100000011001000001… |
… | …0010011101111100111100010 |
3 | 1120002221220221010211220100110 |
4 | 1021000302002103233213202 |
5 | 314042041034002211002 |
6 | 3054540225040232150 |
7 | 124431340633346625 |
oct | 11100620223574742 |
9 | 1502856833756313 |
10 | 321111121132002 |
11 | 93352509590633 |
12 | 300215a090b656 |
13 | 10a238585206a6 |
14 | 5941c0b15ddbc |
15 | 271cc856b0e6c |
hex | 1240c824ef9e2 |
321111121132002 has 32 divisors (see below), whose sum is σ = 644265800640000. Its totient is φ = 106696641011328.
The previous prime is 321111121131989. The next prime is 321111121132019. The reversal of 321111121132002 is 200231121111123.
It is a super-3 number, since 3×3211111211320023 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 321111121132002.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17578627 + ... + 30842022.
It is an arithmetic number, because the mean of its divisors is an integer number (20133306270000).
Almost surely, 2321111121132002 is an apocalyptic number.
321111121132002 is an abundant number, since it is smaller than the sum of its proper divisors (323154679507998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321111121132002 is a wasteful number, since it uses less digits than its factorization.
321111121132002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48424170.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 321111121132002 its reverse (200231121111123), we get a palindrome (521342242243125).
The spelling of 321111121132002 in words is "three hundred twenty-one trillion, one hundred eleven billion, one hundred twenty-one million, one hundred thirty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •