Base | Representation |
---|---|
bin | 10000001001111001000… |
… | …001100000110110100010 |
3 | 10221010110000012210211212 |
4 | 100021321001200312202 |
5 | 121142022243032320 |
6 | 2205553153310122 |
7 | 143130051216410 |
oct | 20117101406642 |
9 | 3833400183755 |
10 | 1110132002210 |
11 | 398893635240 |
12 | 15b198b65342 |
13 | 808b9c3265a |
14 | 3ba32d8c2b0 |
15 | 1dd252359c5 |
hex | 10279060da2 |
1110132002210 has 64 divisors (see below), whose sum is σ = 2503116739584. Its totient is φ = 344375236800.
The previous prime is 1110132002123. The next prime is 1110132002267. The reversal of 1110132002210 is 122002310111.
It is a super-3 number, since 3×11101320022103 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3253952 + ... + 3578891.
It is an arithmetic number, because the mean of its divisors is an integer number (39111199056).
Almost surely, 21110132002210 is an apocalyptic number.
1110132002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110132002210 is an abundant number, since it is smaller than the sum of its proper divisors (1392984737374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110132002210 is a wasteful number, since it uses less digits than its factorization.
1110132002210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6833079.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1110132002210 its reverse (122002310111), we get a palindrome (1232134312321).
The spelling of 1110132002210 in words is "one trillion, one hundred ten billion, one hundred thirty-two million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •