Base | Representation |
---|---|
bin | 11101001000101100110… |
… | …011101100110000100101 |
3 | 21002102001012210011211000 |
4 | 131020230303230300211 |
5 | 230301004331310432 |
6 | 4131445002103513 |
7 | 264440354350122 |
oct | 35105463546045 |
9 | 7072035704730 |
10 | 2002206510117 |
11 | 702149417570 |
12 | 28405aaaab99 |
13 | 116a65734c68 |
14 | 6cc9b943749 |
15 | 37136a8357c |
hex | 1d22ccecc25 |
2002206510117 has 32 divisors (see below), whose sum is σ = 3248781419520. Its totient is φ = 1208623950000.
The previous prime is 2002206510107. The next prime is 2002206510151. The reversal of 2002206510117 is 7110156022002.
2002206510117 is a `hidden beast` number, since 2 + 0 + 0 + 2 + 2 + 0 + 651 + 0 + 1 + 1 + 7 = 666.
It is not a de Polignac number, because 2002206510117 - 26 = 2002206510053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002206510107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13354609 + ... + 13503702.
It is an arithmetic number, because the mean of its divisors is an integer number (101524419360).
Almost surely, 22002206510117 is an apocalyptic number.
2002206510117 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2002206510117 is a deficient number, since it is larger than the sum of its proper divisors (1246574909403).
2002206510117 is a wasteful number, since it uses less digits than its factorization.
2002206510117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26858582 (or 26858576 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The spelling of 2002206510117 in words is "two trillion, two billion, two hundred six million, five hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •