Base | Representation |
---|---|
bin | 101111100010110100… |
… | …0111110011111101110 |
3 | 100202112112100112101000 |
4 | 1133011220332133232 |
5 | 3133100111213402 |
6 | 114523143301130 |
7 | 10243064353146 |
oct | 1370550763756 |
9 | 322475315330 |
10 | 102100101102 |
11 | 3a33393314a |
12 | 1795514a7a6 |
13 | 982193460c |
14 | 4d27d35926 |
15 | 29c87c1c1c |
hex | 17c5a3e7ee |
102100101102 has 32 divisors (see below), whose sum is σ = 230275526400. Its totient is φ = 33525405144.
The previous prime is 102100101029. The next prime is 102100101107. The reversal of 102100101102 is 201101001201.
It is a happy number.
It is a super-2 number, since 2×1021001011022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100101107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14106402 + ... + 14113637.
It is an arithmetic number, because the mean of its divisors is an integer number (7196110200).
Almost surely, 2102100101102 is an apocalyptic number.
102100101102 is an abundant number, since it is smaller than the sum of its proper divisors (128175425298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100101102 is a wasteful number, since it uses less digits than its factorization.
102100101102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28220117 (or 28220111 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102100101102 its reverse (201101001201), we get a palindrome (303201102303).
Subtracting 102100101102 from its reverse (201101001201), we obtain a palindrome (99000900099).
The spelling of 102100101102 in words is "one hundred two billion, one hundred million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •