Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …110000110000001001010 |
3 | 10220020212201212222002011 |
4 | 100001120312012001022 |
5 | 121014323031000320 |
6 | 2201443214130134 |
7 | 142354601212540 |
oct | 20013066060112 |
9 | 3806781788064 |
10 | 1101002203210 |
11 | 394a2904a108 |
12 | 15946b4b094a |
13 | 7ca93607220 |
14 | 3b408629d90 |
15 | 1d98d96a05a |
hex | 10058d8604a |
1101002203210 has 64 divisors (see below), whose sum is σ = 2440727235072. Its totient is φ = 348222779136.
The previous prime is 1101002203127. The next prime is 1101002203229. The reversal of 1101002203210 is 123022001011.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1012072 + ... + 1796188.
It is an arithmetic number, because the mean of its divisors is an integer number (38136363048).
Almost surely, 21101002203210 is an apocalyptic number.
1101002203210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101002203210 is an abundant number, since it is smaller than the sum of its proper divisors (1339725031862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101002203210 is a wasteful number, since it uses less digits than its factorization.
1101002203210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785687.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1101002203210 its reverse (123022001011), we get a palindrome (1224024204221).
The spelling of 1101002203210 in words is "one trillion, one hundred one billion, two million, two hundred three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •