Base | Representation |
---|---|
bin | 11101001100101010000… |
… | …000011100110001011111 |
3 | 21002211000021002211012002 |
4 | 131030222000130301133 |
5 | 230333204322110114 |
6 | 4133430311032515 |
7 | 264650545514552 |
oct | 35145200346137 |
9 | 7084007084162 |
10 | 2006454488159 |
11 | 703a29283320 |
12 | 284a4566b73b |
13 | 11729183b934 |
14 | 6d181ba8699 |
15 | 372d498d7de |
hex | 1d32a01cc5f |
2006454488159 has 8 divisors (see below), whose sum is σ = 2189283126528. Its totient is φ = 1823696463960.
The previous prime is 2006454488141. The next prime is 2006454488177. The reversal of 2006454488159 is 9518844546002.
It is an interprime number because it is at equal distance from previous prime (2006454488141) and next prime (2006454488177).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2006454488159 is a prime.
It is a super-2 number, since 2×20064544881592 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2006454488179) 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, 17594117 + ... + 17707790.
It is an arithmetic number, because the mean of its divisors is an integer number (273660390816).
Almost surely, 22006454488159 is an apocalyptic number.
2006454488159 is a deficient number, since it is larger than the sum of its proper divisors (182828638369).
2006454488159 is a wasteful number, since it uses less digits than its factorization.
2006454488159 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35307085.
The product of its (nonzero) digits is 11059200, while the sum is 56.
The spelling of 2006454488159 in words is "two trillion, six billion, four hundred fifty-four million, four hundred eighty-eight thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •