Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …000011110010000110010 |
3 | 10220100202002120200010220 |
4 | 100002123000132100302 |
5 | 121024111212021320 |
6 | 2202145305433510 |
7 | 142424240205651 |
oct | 20023300362062 |
9 | 3810662520126 |
10 | 1102112220210 |
11 | 395448686331 |
12 | 15971b19b896 |
13 | 7cc0c584411 |
14 | 3b4b1c15198 |
15 | 1da0612de40 |
hex | 1009b01e432 |
1102112220210 has 16 divisors (see below), whose sum is σ = 2645069328576. Its totient is φ = 293896592048.
The previous prime is 1102112220199. The next prime is 1102112220211. The reversal of 1102112220210 is 120222112011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1102112220210.
It is not an unprimeable number, because it can be changed into a prime (1102112220211) 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, 18368536974 + ... + 18368537033.
It is an arithmetic number, because the mean of its divisors is an integer number (165316833036).
Almost surely, 21102112220210 is an apocalyptic number.
1102112220210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102112220210 is an abundant number, since it is smaller than the sum of its proper divisors (1542957108366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102112220210 is a wasteful number, since it uses less digits than its factorization.
1102112220210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36737074017.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1102112220210 its reverse (120222112011), we get a palindrome (1222334332221).
The spelling of 1102112220210 in words is "one trillion, one hundred two billion, one hundred twelve million, two hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •