Base | Representation |
---|---|
bin | 100101001101111010111… |
… | …0011100000011001101101 |
3 | 200010000001112221020120201 |
4 | 1022123311303200121231 |
5 | 1132301244030032341 |
6 | 14513505515113501 |
7 | 1035361546063426 |
oct | 112336563403155 |
9 | 20100045836521 |
10 | 5115135002221 |
11 | 16a23533a2862 |
12 | 6a7420442891 |
13 | 2b148039a30a |
14 | 13980693064d |
15 | 8d0ca53b331 |
hex | 4a6f5ce066d |
5115135002221 has 2 divisors, whose sum is σ = 5115135002222. Its totient is φ = 5115135002220.
The previous prime is 5115135002203. The next prime is 5115135002227. The reversal of 5115135002221 is 1222005315115.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2907072740196 + 2208062262025 = 1705014^2 + 1485955^2 .
It is a cyclic number.
It is not a de Polignac number, because 5115135002221 - 29 = 5115135001709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5115135002221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5115135002227) 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 as a sum of consecutive naturals, namely, 2557567501110 + 2557567501111.
It is an arithmetic number, because the mean of its divisors is an integer number (2557567501111).
Almost surely, 25115135002221 is an apocalyptic number.
It is an amenable number.
5115135002221 is a deficient number, since it is larger than the sum of its proper divisors (1).
5115135002221 is an equidigital number, since it uses as much as digits as its factorization.
5115135002221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 5115135002221 in words is "five trillion, one hundred fifteen billion, one hundred thirty-five million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •