Base | Representation |
---|---|
bin | 1001001011110111011011… |
… | …1010110011100101111001 |
3 | 1022202111110221212100212012 |
4 | 2102331312322303211321 |
5 | 2310432200042140212 |
6 | 33251343535255305 |
7 | 2061443054054102 |
oct | 222756672634571 |
9 | 38674427770765 |
10 | 10099463240057 |
11 | 3244181785464 |
12 | 117141597a535 |
13 | 5834b56b2019 |
14 | 26cb60b893a9 |
15 | 127a9bea2922 |
hex | 92f76eb3979 |
10099463240057 has 2 divisors, whose sum is σ = 10099463240058. Its totient is φ = 10099463240056.
The previous prime is 10099463240033. The next prime is 10099463240081. The reversal of 10099463240057 is 75004236499001.
It is a balanced prime because it is at equal distance from previous prime (10099463240033) and next prime (10099463240081).
It can be written as a sum of positive squares in only one way, i.e., 9377828280976 + 721634959081 = 3062324^2 + 849491^2 .
It is a cyclic number.
It is not a de Polignac number, because 10099463240057 - 214 = 10099463223673 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10099463239987 and 10099463240014.
It is not a weakly prime, because it can be changed into another prime (10099463240357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5049731620028 + 5049731620029.
It is an arithmetic number, because the mean of its divisors is an integer number (5049731620029).
Almost surely, 210099463240057 is an apocalyptic number.
It is an amenable number.
10099463240057 is a deficient number, since it is larger than the sum of its proper divisors (1).
10099463240057 is an equidigital number, since it uses as much as digits as its factorization.
10099463240057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 50.
The spelling of 10099463240057 in words is "ten trillion, ninety-nine billion, four hundred sixty-three million, two hundred forty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •