Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …101101010100000100101111 |
3 | 111101212020001201211021110220 |
4 | 113033031022231110010233 |
5 | 101343421100022413012 |
6 | 1001210010522102423 |
7 | 30345464164252332 |
oct | 2717151255240457 |
9 | 441766051737426 |
10 | 102200000201007 |
11 | 2a62285a846185 |
12 | b56706534aa13 |
13 | 4504559a69b07 |
14 | 1b347137d6619 |
15 | bc36cac6108c |
hex | 5cf34ab5412f |
102200000201007 has 8 divisors (see below), whose sum is σ = 142191304627584. Its totient is φ = 65171014620888.
The previous prime is 102200000200997. The next prime is 102200000201017. The reversal of 102200000201007 is 700102000002201.
It is an interprime number because it is at equal distance from previous prime (102200000200997) and next prime (102200000201017).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102200000201007 - 215 = 102200000168239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200000201017) 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, 740579711533 + ... + 740579711670.
It is an arithmetic number, because the mean of its divisors is an integer number (17773913078448).
Almost surely, 2102200000201007 is an apocalyptic number.
102200000201007 is a deficient number, since it is larger than the sum of its proper divisors (39991304426577).
102200000201007 is a wasteful number, since it uses less digits than its factorization.
102200000201007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1481159423229.
The product of its (nonzero) digits is 56, while the sum is 15.
Adding to 102200000201007 its reverse (700102000002201), we get a palindrome (802302000203208).
The spelling of 102200000201007 in words is "one hundred two trillion, two hundred billion, two hundred one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •