Base | Representation |
---|---|
bin | 1101101100000111001110… |
… | …1000111001001100011011 |
3 | 1222021220120022001010112202 |
4 | 3123001303220321030123 |
5 | 3433100440402130201 |
6 | 52002322143200415 |
7 | 3112302223565651 |
oct | 333016350711433 |
9 | 58256508033482 |
10 | 15051505505051 |
11 | 4883342513884 |
12 | 18310ba8a610b |
13 | 852473b5b3a2 |
14 | 3a06d513cdd1 |
15 | 1b17ce28ec6b |
hex | db073a3931b |
15051505505051 has 2 divisors, whose sum is σ = 15051505505052. Its totient is φ = 15051505505050.
The previous prime is 15051505505041. The next prime is 15051505505059. The reversal of 15051505505051 is 15050550515051.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 15051505505051 - 234 = 15034325635867 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 15051505504996 and 15051505505014.
It is not a weakly prime, because it can be changed into another prime (15051505505059) 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, 7525752752525 + 7525752752526.
It is an arithmetic number, because the mean of its divisors is an integer number (7525752752526).
Almost surely, 215051505505051 is an apocalyptic number.
15051505505051 is a deficient number, since it is larger than the sum of its proper divisors (1).
15051505505051 is an equidigital number, since it uses as much as digits as its factorization.
15051505505051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78125, while the sum is 38.
The spelling of 15051505505051 in words is "fifteen trillion, fifty-one billion, five hundred five million, five hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •