Base | Representation |
---|---|
bin | 1101101100111111001000… |
… | …1010100100111101010001 |
3 | 1222100100022012121022022010 |
4 | 3123033302022210331101 |
5 | 3433322204332304121 |
6 | 52013243253333133 |
7 | 3113343145603662 |
oct | 333176212447521 |
9 | 58310265538263 |
10 | 15066513166161 |
11 | 4889743998796 |
12 | 1833ba89371a9 |
13 | 8539c615a532 |
14 | 3a131a399369 |
15 | 1b1dabab9376 |
hex | db3f22a4f51 |
15066513166161 has 8 divisors (see below), whose sum is σ = 20371623436224. Its totient is φ = 9902872503440.
The previous prime is 15066513166129. The next prime is 15066513166169. The reversal of 15066513166161 is 16166131566051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15066513166161 - 25 = 15066513166129 is a prime.
It is a super-2 number, since 2×150665131661612 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15066513166161.
It is not an unprimeable number, because it can be changed into a prime (15066513166169) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35367401586 + ... + 35367402011.
It is an arithmetic number, because the mean of its divisors is an integer number (2546452929528).
Almost surely, 215066513166161 is an apocalyptic number.
It is an amenable number.
15066513166161 is a deficient number, since it is larger than the sum of its proper divisors (5305110270063).
15066513166161 is an equidigital number, since it uses as much as digits as its factorization.
15066513166161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70734803671.
The product of its (nonzero) digits is 583200, while the sum is 48.
The spelling of 15066513166161 in words is "fifteen trillion, sixty-six billion, five hundred thirteen million, one hundred sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •