Base | Representation |
---|---|
bin | 101111011111110111… |
… | …1010100110010110001 |
3 | 100202021122001212010122 |
4 | 1132333233110302301 |
5 | 3132344240231001 |
6 | 114505245340025 |
7 | 10240453030061 |
oct | 1367757246261 |
9 | 322248055118 |
10 | 102001102001 |
11 | 3a292a65707 |
12 | 17927b67615 |
13 | 9807281576 |
14 | 4d18b253a1 |
15 | 29bec68b1b |
hex | 17bfbd4cb1 |
102001102001 has 8 divisors (see below), whose sum is σ = 103022428008. Its totient is φ = 100980000000.
The previous prime is 102001101997. The next prime is 102001102031. The reversal of 102001102001 is 100201100201.
It can be written as a sum of positive squares in 4 ways, for example, as 41705808400 + 60295293601 = 204220^2 + 245551^2 .
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 102001102001 - 22 = 102001101997 is a prime.
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 102001102001.
It is not an unprimeable number, because it can be changed into a prime (102001102031) 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, 949001 + ... + 1051001.
It is an arithmetic number, because the mean of its divisors is an integer number (12877803501).
Almost surely, 2102001102001 is an apocalyptic number.
It is an amenable number.
102001102001 is a deficient number, since it is larger than the sum of its proper divisors (1021326007).
102001102001 is a wasteful number, since it uses less digits than its factorization.
102001102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112003.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 102001102001 its reverse (100201100201), we get a palindrome (202202202202).
The spelling of 102001102001 in words is "one hundred two billion, one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •