Base | Representation |
---|---|
bin | 101111100010110110… |
… | …0110010110110110001 |
3 | 100202112121020101100100 |
4 | 1133011230302312301 |
5 | 3133100340231001 |
6 | 114523220543013 |
7 | 10243106022213 |
oct | 1370554626661 |
9 | 322477211310 |
10 | 102101102001 |
11 | 3a334457138 |
12 | 17955551a69 |
13 | 9821bc5072 |
14 | 4d281165b3 |
15 | 29c891d586 |
hex | 17c5b32db1 |
102101102001 has 6 divisors (see below), whose sum is σ = 147479369570. Its totient is φ = 68067401328.
The previous prime is 102101101979. The next prime is 102101102017. The reversal of 102101102001 is 100201101201.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 100996204401 + 1104897600 = 317799^2 + 33240^2 .
It is not a de Polignac number, because 102101102001 - 210 = 102101100977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11344566889 = 102101102001 / (1 + 0 + 2 + 1 + 0 + 1 + 1 + 0 + 2 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102101102071) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5672283436 + ... + 5672283453.
Almost surely, 2102101102001 is an apocalyptic number.
It is an amenable number.
102101102001 is a deficient number, since it is larger than the sum of its proper divisors (45378267569).
102101102001 is a wasteful number, since it uses less digits than its factorization.
102101102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11344566895 (or 11344566892 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102101102001 its reverse (100201101201), we get a palindrome (202302203202).
The spelling of 102101102001 in words is "one hundred two billion, one hundred one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •