Base | Representation |
---|---|
bin | 10111010010001000010111… |
… | …010111001000011110011111 |
3 | 111102120102212220120100121002 |
4 | 113102020113113020132133 |
5 | 101410214223031224411 |
6 | 1001442212044500515 |
7 | 30366141203202053 |
oct | 2722102727103637 |
9 | 442512786510532 |
10 | 102401002211231 |
11 | 2a6a00261834a9 |
12 | b59a00054a73b |
13 | 451a4b084b139 |
14 | 1b403409c9c63 |
15 | bc8a4216233b |
hex | 5d22175c879f |
102401002211231 has 2 divisors, whose sum is σ = 102401002211232. Its totient is φ = 102401002211230.
The previous prime is 102401002211227. The next prime is 102401002211269. The reversal of 102401002211231 is 132112200104201.
It is a weak prime.
It is an emirp because it is prime and its reverse (132112200104201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102401002211231 - 22 = 102401002211227 is a prime.
It is a super-2 number, since 2×1024010022112312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102401002211201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51200501105615 + 51200501105616.
It is an arithmetic number, because the mean of its divisors is an integer number (51200501105616).
Almost surely, 2102401002211231 is an apocalyptic number.
102401002211231 is a deficient number, since it is larger than the sum of its proper divisors (1).
102401002211231 is an equidigital number, since it uses as much as digits as its factorization.
102401002211231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 102401002211231 its reverse (132112200104201), we get a palindrome (234513202315432).
The spelling of 102401002211231 in words is "one hundred two trillion, four hundred one billion, two million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •