Base | Representation |
---|---|
bin | 10111010000000001000101… |
… | …000001100011000101001011 |
3 | 111102001112221021222211020121 |
4 | 113100001011001203011023 |
5 | 101400324223242320112 |
6 | 1001251345503004111 |
7 | 30352506355625056 |
oct | 2720010501430513 |
9 | 442045837884217 |
10 | 102255739416907 |
11 | 2a64446311006a |
12 | b575a20299637 |
13 | 45098a085847b |
14 | 1b372c044da9d |
15 | bc4d8e3c9407 |
hex | 5d004506314b |
102255739416907 has 2 divisors, whose sum is σ = 102255739416908. Its totient is φ = 102255739416906.
The previous prime is 102255739416899. The next prime is 102255739416983. The reversal of 102255739416907 is 709614937552201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102255739416907 - 23 = 102255739416899 is a prime.
It is not a weakly prime, because it can be changed into another prime (102255739216907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51127869708453 + 51127869708454.
It is an arithmetic number, because the mean of its divisors is an integer number (51127869708454).
Almost surely, 2102255739416907 is an apocalyptic number.
102255739416907 is a deficient number, since it is larger than the sum of its proper divisors (1).
102255739416907 is an equidigital number, since it uses as much as digits as its factorization.
102255739416907 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28576800, while the sum is 61.
The spelling of 102255739416907 in words is "one hundred two trillion, two hundred fifty-five billion, seven hundred thirty-nine million, four hundred sixteen thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •