Base | Representation |
---|---|
bin | 1011010101110001111010… |
… | …1100010100100000101001 |
3 | 1122011000011110101101010121 |
4 | 2311130132230110200221 |
5 | 3113242103034320423 |
6 | 42304031232043241 |
7 | 2424561416510635 |
oct | 265343654244051 |
9 | 48130143341117 |
10 | 12468804995113 |
11 | 3a77a993a4425 |
12 | 1494655693521 |
13 | 6c5a59a0c88c |
14 | 3116c9ba7dc5 |
15 | 16952007945d |
hex | b571eb14829 |
12468804995113 has 2 divisors, whose sum is σ = 12468804995114. Its totient is φ = 12468804995112.
The previous prime is 12468804995111. The next prime is 12468804995131. The reversal of 12468804995113 is 31159940886421.
Together with next prime (12468804995131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8844247749184 + 3624557245929 = 2973928^2 + 1903827^2 .
It is a cyclic number.
It is not a de Polignac number, because 12468804995113 - 21 = 12468804995111 is a prime.
Together with 12468804995111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12468804995111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6234402497556 + 6234402497557.
It is an arithmetic number, because the mean of its divisors is an integer number (6234402497557).
Almost surely, 212468804995113 is an apocalyptic number.
It is an amenable number.
12468804995113 is a deficient number, since it is larger than the sum of its proper divisors (1).
12468804995113 is an equidigital number, since it uses as much as digits as its factorization.
12468804995113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14929920, while the sum is 61.
The spelling of 12468804995113 in words is "twelve trillion, four hundred sixty-eight billion, eight hundred four million, nine hundred ninety-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •