Base | Representation |
---|---|
bin | 1011010100000000101011… |
… | …1100010110000111110111 |
3 | 1122001002201002201202211202 |
4 | 2311000022330112013313 |
5 | 3112242330133140011 |
6 | 42242043125523115 |
7 | 2422434240012236 |
oct | 265001274260767 |
9 | 48032632652752 |
10 | 12438408880631 |
11 | 3a661105a9758 |
12 | 148a791b7349b |
13 | 6c2c24566916 |
14 | 310044ccab1d |
15 | 1688417a823b |
hex | b500af161f7 |
12438408880631 has 2 divisors, whose sum is σ = 12438408880632. Its totient is φ = 12438408880630.
The previous prime is 12438408880607. The next prime is 12438408880633. The reversal of 12438408880631 is 13608880483421.
12438408880631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12438408880631 - 210 = 12438408879607 is a prime.
It is a super-2 number, since 2×124384088806312 (a number of 27 digits) contains 22 as substring.
Together with 12438408880633, 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 (12438408880633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6219204440315 + 6219204440316.
It is an arithmetic number, because the mean of its divisors is an integer number (6219204440316).
Almost surely, 212438408880631 is an apocalyptic number.
12438408880631 is a deficient number, since it is larger than the sum of its proper divisors (1).
12438408880631 is an equidigital number, since it uses as much as digits as its factorization.
12438408880631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7077888, while the sum is 56.
The spelling of 12438408880631 in words is "twelve trillion, four hundred thirty-eight billion, four hundred eight million, eight hundred eighty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •