Base | Representation |
---|---|
bin | 11100100111110001… |
… | …01100110000001101 |
3 | 1110122212212111021012 |
4 | 32103320230300031 |
5 | 222432200003023 |
6 | 11020431015005 |
7 | 1052532660335 |
oct | 162370546015 |
9 | 43585774235 |
10 | 15366016013 |
11 | 6575796297 |
12 | 2b8a06a465 |
13 | 15ab61c18a |
14 | a5aaa00c5 |
15 | 5ee013978 |
hex | 393e2cc0d |
15366016013 has 2 divisors, whose sum is σ = 15366016014. Its totient is φ = 15366016012.
The previous prime is 15366015943. The next prime is 15366016033. The reversal of 15366016013 is 31061066351.
15366016013 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 can be written as a sum of positive squares in only one way, i.e., 13976441284 + 1389574729 = 118222^2 + 37277^2 .
It is a cyclic number.
It is not a de Polignac number, because 15366016013 - 218 = 15365753869 is a prime.
It is a super-2 number, since 2×153660160132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15366016033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7683008006 + 7683008007.
It is an arithmetic number, because the mean of its divisors is an integer number (7683008007).
Almost surely, 215366016013 is an apocalyptic number.
It is an amenable number.
15366016013 is a deficient number, since it is larger than the sum of its proper divisors (1).
15366016013 is an equidigital number, since it uses as much as digits as its factorization.
15366016013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The spelling of 15366016013 in words is "fifteen billion, three hundred sixty-six million, sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •