Base | Representation |
---|---|
bin | 101111100110110000… |
… | …0100101101100101110 |
3 | 100202212201202210101220 |
4 | 1133031200211230232 |
5 | 3133332410320420 |
6 | 114544221044210 |
7 | 10246256453211 |
oct | 1371540455456 |
9 | 322781683356 |
10 | 102232120110 |
11 | 3a3a1403a6a |
12 | 179913b6666 |
13 | 98430a9083 |
14 | 4d3b69d778 |
15 | 29d519d840 |
hex | 17cd825b2e |
102232120110 has 16 divisors (see below), whose sum is σ = 245357088336. Its totient is φ = 27261898688.
The previous prime is 102232120093. The next prime is 102232120117. The reversal of 102232120110 is 11021232201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102232120110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102232120117) 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, 1703868639 + ... + 1703868698.
It is an arithmetic number, because the mean of its divisors is an integer number (15334818021).
Almost surely, 2102232120110 is an apocalyptic number.
102232120110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102232120110 is an abundant number, since it is smaller than the sum of its proper divisors (143124968226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102232120110 is a wasteful number, since it uses less digits than its factorization.
102232120110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3407737347.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102232120110 its reverse (11021232201), we get a palindrome (113253352311).
The spelling of 102232120110 in words is "one hundred two billion, two hundred thirty-two million, one hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •