Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0001011111111110001 |
3 | 101112012012112021222200 |
4 | 1212202212023333301 |
5 | 3300442114231001 |
6 | 122325154053413 |
7 | 10645301265633 |
oct | 1464246137761 |
9 | 345165467880 |
10 | 110102102001 |
11 | 4276a847931 |
12 | 19408b7a269 |
13 | a4c86c83a8 |
14 | 54869a0a53 |
15 | 2ce6065086 |
hex | 19a298bff1 |
110102102001 has 12 divisors (see below), whose sum is σ = 161276319360. Its totient is φ = 72367578360.
The previous prime is 110102101997. The next prime is 110102102009. The reversal of 110102102001 is 100201201011.
It is a happy number.
It is not a de Polignac number, because 110102102001 - 22 = 110102101997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110102102009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 86151241 + ... + 86152518.
It is an arithmetic number, because the mean of its divisors is an integer number (13439693280).
Almost surely, 2110102102001 is an apocalyptic number.
It is an amenable number.
110102102001 is a deficient number, since it is larger than the sum of its proper divisors (51174217359).
110102102001 is a wasteful number, since it uses less digits than its factorization.
110102102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172303836 (or 172303833 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110102102001 its reverse (100201201011), we get a palindrome (210303303012).
The spelling of 110102102001 in words is "one hundred ten billion, one hundred two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •