Base | Representation |
---|---|
bin | 10111000110110110000100… |
… | …011001001111110010001011 |
3 | 111022211022000210221220201122 |
4 | 113012312010121033302023 |
5 | 101310012401223321134 |
6 | 1000050030030305455 |
7 | 30256124125451606 |
oct | 2706660431176213 |
9 | 438738023856648 |
10 | 101625442401419 |
11 | 2a4211209583a2 |
12 | b49383705828b |
13 | 4492313141681 |
14 | 1b149aa52733d |
15 | bb379e81302e |
hex | 5c6d8464fc8b |
101625442401419 has 2 divisors, whose sum is σ = 101625442401420. Its totient is φ = 101625442401418.
The previous prime is 101625442401401. The next prime is 101625442401433. The reversal of 101625442401419 is 914104244526101.
It is a strong prime.
It is an emirp because it is prime and its reverse (914104244526101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101625442401419 - 228 = 101625173965963 is a prime.
It is a super-2 number, since 2×1016254424014192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101625442401419.
It is not a weakly prime, because it can be changed into another prime (101625442401449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50812721200709 + 50812721200710.
It is an arithmetic number, because the mean of its divisors is an integer number (50812721200710).
Almost surely, 2101625442401419 is an apocalyptic number.
101625442401419 is a deficient number, since it is larger than the sum of its proper divisors (1).
101625442401419 is an equidigital number, since it uses as much as digits as its factorization.
101625442401419 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 276480, while the sum is 44.
The spelling of 101625442401419 in words is "one hundred one trillion, six hundred twenty-five billion, four hundred forty-two million, four hundred one thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •