Base | Representation |
---|---|
bin | 10000000010010100010… |
… | …100011001010010100010 |
3 | 10220100110021102101222200 |
4 | 100002110110121102202 |
5 | 121023344000032320 |
6 | 2202130220314030 |
7 | 142421405315532 |
oct | 20022424312242 |
9 | 3810407371880 |
10 | 1102000002210 |
11 | 3953a02aa288 |
12 | 1596a96a2916 |
13 | 7cbc2253633 |
14 | 3b4a0d634c2 |
15 | 1d9eb364290 |
hex | 100945194a2 |
1102000002210 has 96 divisors (see below), whose sum is σ = 2874301597440. Its totient is φ = 292934102400.
The previous prime is 1102000002199. The next prime is 1102000002241. The reversal of 1102000002210 is 122000002011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1102000002192 and 1102000002201.
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 47 ways as a sum of consecutive naturals, for example, 64094715 + ... + 64111905.
It is an arithmetic number, because the mean of its divisors is an integer number (29940641640).
Almost surely, 21102000002210 is an apocalyptic number.
1102000002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102000002210 is an abundant number, since it is smaller than the sum of its proper divisors (1772301595230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102000002210 is a wasteful number, since it uses less digits than its factorization.
1102000002210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19424 (or 19421 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1102000002210 its reverse (122000002011), we get a palindrome (1224000004221).
The spelling of 1102000002210 in words is "one trillion, one hundred two billion, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •