Base | Representation |
---|---|
bin | 101111100010110100… |
… | …0111110101101110001 |
3 | 100202112112100120121022 |
4 | 1133011220332231301 |
5 | 3133100111231001 |
6 | 114523143305225 |
7 | 10243064355602 |
oct | 1370550765561 |
9 | 322475316538 |
10 | 102100102001 |
11 | 3a333933897 |
12 | 1795514b215 |
13 | 9821934b51 |
14 | 4d27d35da9 |
15 | 29c87c211b |
hex | 17c5a3eb71 |
102100102001 has 8 divisors (see below), whose sum is σ = 113795779680. Its totient is φ = 91036623168.
The previous prime is 102100101991. The next prime is 102100102009. The reversal of 102100102001 is 100201001201.
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 102100102001 - 26 = 102100101937 is a prime.
It is a super-2 number, since 2×1021001020012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102100102001.
It is not an unprimeable number, because it can be changed into a prime (102100102009) 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, 158049371 + ... + 158050016.
It is an arithmetic number, because the mean of its divisors is an integer number (14224472460).
Almost surely, 2102100102001 is an apocalyptic number.
It is an amenable number.
102100102001 is a deficient number, since it is larger than the sum of its proper divisors (11695677679).
102100102001 is a wasteful number, since it uses less digits than its factorization.
102100102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316099423.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 102100102001 its reverse (100201001201), we get a palindrome (202301103202).
The spelling of 102100102001 in words is "one hundred two billion, one hundred million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •