Base | Representation |
---|---|
bin | 101111111000010011101011… |
… | …0110000100100011000100101 |
3 | 2001020012001012210101221200221 |
4 | 1133300213112300210120211 |
5 | 420200201333031400122 |
6 | 4051420011050204341 |
7 | 154465313513104456 |
oct | 13760472660443045 |
9 | 2036161183357627 |
10 | 421155211200037 |
11 | 112213a16257466 |
12 | 3b29a8501236b1 |
13 | 150cc9c5bb4492 |
14 | 760004181b12d |
15 | 33a5330a7e6c7 |
hex | 17f09d6c24625 |
421155211200037 has 2 divisors, whose sum is σ = 421155211200038. Its totient is φ = 421155211200036.
The previous prime is 421155211199999. The next prime is 421155211200109. The reversal of 421155211200037 is 730002112551124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 416636721245761 + 4518489954276 = 20411681^2 + 2125674^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421155211200037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 421155211199975 and 421155211200011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421155211240037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210577605600018 + 210577605600019.
It is an arithmetic number, because the mean of its divisors is an integer number (210577605600019).
Almost surely, 2421155211200037 is an apocalyptic number.
It is an amenable number.
421155211200037 is a deficient number, since it is larger than the sum of its proper divisors (1).
421155211200037 is an equidigital number, since it uses as much as digits as its factorization.
421155211200037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16800, while the sum is 34.
The spelling of 421155211200037 in words is "four hundred twenty-one trillion, one hundred fifty-five billion, two hundred eleven million, two hundred thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •