Base | Representation |
---|---|
bin | 101111101011110000… |
… | …1011011111011010111 |
3 | 100210022102212210020022 |
4 | 1133113201123323113 |
5 | 3134203412130031 |
6 | 115013021455355 |
7 | 10253366416361 |
oct | 1372741337327 |
9 | 323272783208 |
10 | 102400114391 |
11 | 3a478216613 |
12 | 17a1971155b |
13 | 986bb38483 |
14 | 4d55b0dd31 |
15 | 29e4cd497b |
hex | 17d785bed7 |
102400114391 has 2 divisors, whose sum is σ = 102400114392. Its totient is φ = 102400114390.
The previous prime is 102400114373. The next prime is 102400114417. The reversal of 102400114391 is 193411004201.
It is a happy number.
It is an a-pointer prime, because the next prime (102400114417) can be obtained adding 102400114391 to its sum of digits (26).
It is a weak prime.
It is an emirp because it is prime and its reverse (193411004201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102400114391 - 222 = 102395920087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102400114391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102400114291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51200057195 + 51200057196.
It is an arithmetic number, because the mean of its divisors is an integer number (51200057196).
Almost surely, 2102400114391 is an apocalyptic number.
102400114391 is a deficient number, since it is larger than the sum of its proper divisors (1).
102400114391 is an equidigital number, since it uses as much as digits as its factorization.
102400114391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 102400114391 its reverse (193411004201), we get a palindrome (295811118592).
The spelling of 102400114391 in words is "one hundred two billion, four hundred million, one hundred fourteen thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •