Base | Representation |
---|---|
bin | 1001101001000001111101… |
… | …10010100000010100001110 |
3 | 2210001210111222102112200012 |
4 | 10310200332302200110032 |
5 | 10234324133033000024 |
6 | 113031335505233222 |
7 | 4315502561415200 |
oct | 464407662402416 |
9 | 83053458375605 |
10 | 21201012000014 |
11 | 6834331623780 |
12 | 2464a94032812 |
13 | baa32944a902 |
14 | 5341c4d38770 |
15 | 26b74882350e |
hex | 13483eca050e |
21201012000014 has 192 divisors, whose sum is σ = 44323396204032. Its totient is φ = 7489407744000.
The previous prime is 21201012000013. The next prime is 21201012000067. The reversal of 21201012000014 is 41000021010212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201012000011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 57341039 + ... + 57709589.
It is an arithmetic number, because the mean of its divisors is an integer number (230851021896).
Almost surely, 221201012000014 is an apocalyptic number.
21201012000014 is an abundant number, since it is smaller than the sum of its proper divisors (23122384204018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21201012000014 is a wasteful number, since it uses less digits than its factorization.
21201012000014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368711 (or 368704 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21201012000014 its reverse (41000021010212), we get a palindrome (62201033010226).
The spelling of 21201012000014 in words is "twenty-one trillion, two hundred one billion, twelve million, fourteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •