Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …010000111010000100111111 |
3 | 111101111200012121020202002222 |
4 | 113031300020100322010333 |
5 | 101340302001402213211 |
6 | 1001052050004035555 |
7 | 30335326454662052 |
oct | 2715601020720477 |
9 | 441450177222088 |
10 | 102100101210431 |
11 | 2a594456430a45 |
12 | b54b825392bbb |
13 | 44c7cc916547c |
14 | 1b2d957d4aa99 |
15 | bc0cd082a1db |
hex | 5cdc0843a13f |
102100101210431 has 2 divisors, whose sum is σ = 102100101210432. Its totient is φ = 102100101210430.
The previous prime is 102100101210421. The next prime is 102100101210433. The reversal of 102100101210431 is 134012101001201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102100101210431 - 226 = 102100034101567 is a prime.
It is a super-2 number, since 2×1021001012104312 (a number of 29 digits) contains 22 as substring.
Together with 102100101210433, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102100101210433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050050605215 + 51050050605216.
It is an arithmetic number, because the mean of its divisors is an integer number (51050050605216).
Almost surely, 2102100101210431 is an apocalyptic number.
102100101210431 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100101210431 is an equidigital number, since it uses as much as digits as its factorization.
102100101210431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 102100101210431 its reverse (134012101001201), we get a palindrome (236112202211632).
The spelling of 102100101210431 in words is "one hundred two trillion, one hundred billion, one hundred one million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •