Base | Representation |
---|---|
bin | 100101010010001100001… |
… | …1000010001011010010001 |
3 | 200010212201121220101211002 |
4 | 1022210120120101122101 |
5 | 1132424034040000311 |
6 | 14522023452031345 |
7 | 1036135024554161 |
oct | 112443030213221 |
9 | 20125647811732 |
10 | 5124305000081 |
11 | 16a6229644993 |
12 | 6a915b462555 |
13 | 2b22b212b957 |
14 | 13a0367585a1 |
15 | 8d4655e793b |
hex | 4a918611691 |
5124305000081 has 2 divisors, whose sum is σ = 5124305000082. Its totient is φ = 5124305000080.
The previous prime is 5124305000057. The next prime is 5124305000117. The reversal of 5124305000081 is 1800005034215.
5124305000081 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3816005971600 + 1308299028481 = 1953460^2 + 1143809^2 .
It is a cyclic number.
It is not a de Polignac number, because 5124305000081 - 214 = 5124304983697 is a prime.
It is a super-2 number, since 2×51243050000812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5124305000681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2562152500040 + 2562152500041.
It is an arithmetic number, because the mean of its divisors is an integer number (2562152500041).
Almost surely, 25124305000081 is an apocalyptic number.
It is an amenable number.
5124305000081 is a deficient number, since it is larger than the sum of its proper divisors (1).
5124305000081 is an equidigital number, since it uses as much as digits as its factorization.
5124305000081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4800, while the sum is 29.
The spelling of 5124305000081 in words is "five trillion, one hundred twenty-four billion, three hundred five million, eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •