Base | Representation |
---|---|
bin | 1110111110001100010001… |
… | …1110100001111101000101 |
3 | 2011021201021222100001222002 |
4 | 3233203010132201331011 |
5 | 4124201334410003010 |
6 | 55002205410115045 |
7 | 3316212031635041 |
oct | 357430436417505 |
9 | 64251258301862 |
10 | 16461611016005 |
11 | 527736a2a1011 |
12 | 1a1a45427ba85 |
13 | 92542827572c |
14 | 40ca638d5021 |
15 | 1d830e6a01a5 |
hex | ef8c47a1f45 |
16461611016005 has 8 divisors (see below), whose sum is σ = 20915929291032. Its totient is φ = 12394624764928.
The previous prime is 16461611015981. The next prime is 16461611016013. The reversal of 16461611016005 is 50061011616461.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2786392224001 + 13675218792004 = 1669249^2 + 3698002^2 .
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 16461611016005 - 28 = 16461611015749 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16461611016005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96833005892 + ... + 96833006061.
It is an arithmetic number, because the mean of its divisors is an integer number (2614491161379).
Almost surely, 216461611016005 is an apocalyptic number.
It is an amenable number.
16461611016005 is a deficient number, since it is larger than the sum of its proper divisors (4454318275027).
16461611016005 is a wasteful number, since it uses less digits than its factorization.
16461611016005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193666011975.
The product of its (nonzero) digits is 25920, while the sum is 38.
The spelling of 16461611016005 in words is "sixteen trillion, four hundred sixty-one billion, six hundred eleven million, sixteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •