Base | Representation |
---|---|
bin | 11101010010110110001… |
… | …11100011110100110001 |
3 | 10120020002021101112102100 |
4 | 32221123013203310301 |
5 | 112442404032240130 |
6 | 2050223030211013 |
7 | 132502162543461 |
oct | 16513307436461 |
9 | 3506067345370 |
10 | 1006551055665 |
11 | 35896a914a91 |
12 | 1430abab3a69 |
13 | 73bc058443c |
14 | 36a084dbba1 |
15 | 1b2b194ec60 |
hex | ea5b1e3d31 |
1006551055665 has 24 divisors (see below), whose sum is σ = 1753823006208. Its totient is φ = 534016611360.
The previous prime is 1006551055651. The next prime is 1006551055721. The reversal of 1006551055665 is 5665501556001.
1006551055665 is a `hidden beast` number, since 10 + 0 + 65 + 5 + 10 + 5 + 566 + 5 = 666.
It is not a de Polignac number, because 1006551055665 - 228 = 1006282620209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1006551055665.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58545859 + ... + 58563048.
It is an arithmetic number, because the mean of its divisors is an integer number (73075958592).
Almost surely, 21006551055665 is an apocalyptic number.
1006551055665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1006551055665 is a deficient number, since it is larger than the sum of its proper divisors (747271950543).
1006551055665 is a wasteful number, since it uses less digits than its factorization.
1006551055665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117109109 (or 117109106 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 45.
The spelling of 1006551055665 in words is "one trillion, six billion, five hundred fifty-one million, fifty-five thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •