Base | Representation |
---|---|
bin | 110000010010111111011100… |
… | …101111010110000101101000 |
3 | 1000212002022201110222000011201 |
4 | 300102333130233112011220 |
5 | 210320121331110204230 |
6 | 2031432224214133544 |
7 | 62512132205332045 |
oct | 6022773457260550 |
9 | 1025068643860151 |
10 | 212411311022440 |
11 | 61754149580082 |
12 | 1b9a689a3512b4 |
13 | 916a3ba7a128a |
14 | 3a64a95ab81cc |
15 | 198548b8d25ca |
hex | c12fdcbd6168 |
212411311022440 has 128 divisors (see below), whose sum is σ = 528055358526720. Its totient is φ = 76487634432000.
The previous prime is 212411311022401. The next prime is 212411311022569. The reversal of 212411311022440 is 44220113114212.
It is a junction number, because it is equal to n+sod(n) for n = 212411311022399 and 212411311022408.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 614494855 + ... + 614840425.
It is an arithmetic number, because the mean of its divisors is an integer number (4125432488490).
Almost surely, 2212411311022440 is an apocalyptic number.
212411311022440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212411311022440 is an abundant number, since it is smaller than the sum of its proper divisors (315644047504280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212411311022440 is a wasteful number, since it uses less digits than its factorization.
212411311022440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384923 (or 384919 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 212411311022440 its reverse (44220113114212), we get a palindrome (256631424136652).
The spelling of 212411311022440 in words is "two hundred twelve trillion, four hundred eleven billion, three hundred eleven million, twenty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •