Base | Representation |
---|---|
bin | 101111011111110111… |
… | …1011100000111100001 |
3 | 100202021122010101021202 |
4 | 1132333233130013201 |
5 | 3132344242211001 |
6 | 114505250130545 |
7 | 10240453213406 |
oct | 1367757340741 |
9 | 322248111252 |
10 | 102001132001 |
11 | 3a292a861aa |
12 | 17927b80a55 |
13 | 9807292112 |
14 | 4d18b322ad |
15 | 29bec7296b |
hex | 17bfbdc1e1 |
102001132001 has 4 divisors (see below), whose sum is σ = 102006334404. Its totient is φ = 101995929600.
The previous prime is 102001131959. The next prime is 102001132031. The reversal of 102001132001 is 100231100201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100231100201 = 449 ⋅223231849.
It can be written as a sum of positive squares in 2 ways, for example, as 46328257600 + 55672874401 = 215240^2 + 235951^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001132001 - 218 = 102000869857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102001132031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2571680 + ... + 2611041.
It is an arithmetic number, because the mean of its divisors is an integer number (25501583601).
Almost surely, 2102001132001 is an apocalyptic number.
It is an amenable number.
102001132001 is a deficient number, since it is larger than the sum of its proper divisors (5202403).
102001132001 is an equidigital number, since it uses as much as digits as its factorization.
102001132001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5202402.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 102001132001 its reverse (100231100201), we get a palindrome (202232232202).
The spelling of 102001132001 in words is "one hundred two billion, one million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •