Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …001001110000110111101111 |
3 | 111101111200110111010211022012 |
4 | 113031300032021300313233 |
5 | 101340302202200013012 |
6 | 1001052103453311435 |
7 | 30335332064456165 |
oct | 2715601611606757 |
9 | 441450414124265 |
10 | 102100200001007 |
11 | 2a5944a717684a |
12 | b54b85249557b |
13 | 44c8013774630 |
14 | 1b2d967105235 |
15 | bc0cd9341622 |
hex | 5cdc0e270def |
102100200001007 has 8 divisors (see below), whose sum is σ = 109954803806400. Its totient is φ = 94245702233760.
The previous prime is 102100200001003. The next prime is 102100200001027. The reversal of 102100200001007 is 700100002001201.
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 102100200001007 - 22 = 102100200001003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102100200000982 and 102100200001000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100200001001) 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, 24504119 + ... + 28366392.
It is an arithmetic number, because the mean of its divisors is an integer number (13744350475800).
Almost surely, 2102100200001007 is an apocalyptic number.
102100200001007 is a deficient number, since it is larger than the sum of its proper divisors (7854603805393).
102100200001007 is a wasteful number, since it uses less digits than its factorization.
102100200001007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53019073.
The product of its (nonzero) digits is 28, while the sum is 14.
Adding to 102100200001007 its reverse (700100002001201), we get a palindrome (802200202002208).
The spelling of 102100200001007 in words is "one hundred two trillion, one hundred billion, two hundred million, one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •