Base | Representation |
---|---|
bin | 1110101111100111011011… |
… | …1011111100100001111101 |
3 | 2010101202221112121002202201 |
4 | 3223321312323330201331 |
5 | 4111101020203013041 |
6 | 54251153503551501 |
7 | 3262135461265546 |
oct | 353716673744175 |
9 | 63352845532681 |
10 | 16211202001021 |
11 | 519014a9a4855 |
12 | 1999a0a8bb591 |
13 | 90792c539b51 |
14 | 4008aaa534cd |
15 | 1d1a559e1631 |
hex | ebe76efc87d |
16211202001021 has 2 divisors, whose sum is σ = 16211202001022. Its totient is φ = 16211202001020.
The previous prime is 16211202000991. The next prime is 16211202001073. The reversal of 16211202001021 is 12010020211261.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12699344740996 + 3511857260025 = 3563614^2 + 1873995^2 .
It is a cyclic number.
It is not a de Polignac number, because 16211202001021 - 211 = 16211201998973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16211202001021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16211202001081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8105601000510 + 8105601000511.
It is an arithmetic number, because the mean of its divisors is an integer number (8105601000511).
Almost surely, 216211202001021 is an apocalyptic number.
It is an amenable number.
16211202001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
16211202001021 is an equidigital number, since it uses as much as digits as its factorization.
16211202001021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 16211202001021 its reverse (12010020211261), we get a palindrome (28221222212282).
The spelling of 16211202001021 in words is "sixteen trillion, two hundred eleven billion, two hundred two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •