Base | Representation |
---|---|
bin | 100100011101111100010… |
… | …0011111010100000111101 |
3 | 122202011010000020000120011 |
4 | 1020323320203322200331 |
5 | 1124104241110001141 |
6 | 14354310005023221 |
7 | 1025053363221442 |
oct | 110737043724075 |
9 | 18664100200504 |
10 | 5012102031421 |
11 | 1662690a27921 |
12 | 68b4669b4b11 |
13 | 2a48404010c4 |
14 | 134830b639c9 |
15 | 8a599de8881 |
hex | 48ef88fa83d |
5012102031421 has 32 divisors (see below), whose sum is σ = 5790098350080. Its totient is φ = 4312415764800.
The previous prime is 5012102031407. The next prime is 5012102031427. The reversal of 5012102031421 is 1241302012105.
It is not a de Polignac number, because 5012102031421 - 25 = 5012102031389 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5012102031392 and 5012102031401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5012102031427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2772375 + ... + 4208356.
It is an arithmetic number, because the mean of its divisors is an integer number (180940573440).
Almost surely, 25012102031421 is an apocalyptic number.
It is an amenable number.
5012102031421 is a deficient number, since it is larger than the sum of its proper divisors (777996318659).
5012102031421 is a wasteful number, since it uses less digits than its factorization.
5012102031421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6980857.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 5012102031421 its reverse (1241302012105), we get a palindrome (6253404043526).
The spelling of 5012102031421 in words is "five trillion, twelve billion, one hundred two million, thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •