Base | Representation |
---|---|
bin | 1101101100011000001100… |
… | …0110111110011100001101 |
3 | 1222022100022201011021120011 |
4 | 3123012003012332130031 |
5 | 3433134302331011042 |
6 | 52004354122153221 |
7 | 3112523126363461 |
oct | 333060306763415 |
9 | 58270281137504 |
10 | 15056060016397 |
11 | 488526a406644 |
12 | 1831b70052811 |
13 | 852a1b60c80a |
14 | 3a0a07d984a1 |
15 | 1b1999049a17 |
hex | db1831be70d |
15056060016397 has 2 divisors, whose sum is σ = 15056060016398. Its totient is φ = 15056060016396.
The previous prime is 15056060016307. The next prime is 15056060016461. The reversal of 15056060016397 is 79361006065051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14759842157316 + 296217859081 = 3841854^2 + 544259^2 .
It is a cyclic number.
It is not a de Polignac number, because 15056060016397 - 27 = 15056060016269 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15056060016397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15056060016307) 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, 7528030008198 + 7528030008199.
It is an arithmetic number, because the mean of its divisors is an integer number (7528030008199).
Almost surely, 215056060016397 is an apocalyptic number.
It is an amenable number.
15056060016397 is a deficient number, since it is larger than the sum of its proper divisors (1).
15056060016397 is an equidigital number, since it uses as much as digits as its factorization.
15056060016397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1020600, while the sum is 49.
The spelling of 15056060016397 in words is "fifteen trillion, fifty-six billion, sixty million, sixteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •