Base | Representation |
---|---|
bin | 100000110110001… |
… | …0000100011110010 |
3 | 2211210211120001210 |
4 | 1001230100203302 |
5 | 4224120334302 |
6 | 301210140550 |
7 | 36211606230 |
oct | 10154204362 |
9 | 2753746053 |
10 | 1102121202 |
11 | 516133a76 |
12 | 269121756 |
13 | 147444330 |
14 | a6531950 |
15 | 66b5466c |
hex | 41b108f2 |
1102121202 has 64 divisors (see below), whose sum is σ = 2722003200. Its totient is φ = 289695744.
The previous prime is 1102121173. The next prime is 1102121243. The reversal of 1102121202 is 2021212011.
It is a super-2 number, since 2×11021212022 = 2429342287795849608, which contains 22 as substring.
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, 167674 + ... + 174122.
It is an arithmetic number, because the mean of its divisors is an integer number (42531300).
Almost surely, 21102121202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1102121202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1361001600).
1102121202 is an abundant number, since it is smaller than the sum of its proper divisors (1619881998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102121202 is a wasteful number, since it uses less digits than its factorization.
1102121202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6787.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 1102121202 is about 33198.2108252839. The cubic root of 1102121202 is about 1032.9432271696.
Adding to 1102121202 its reverse (2021212011), we get a palindrome (3123333213).
It can be divided in two parts, 11021 and 21202, that added together give a palindrome (32223).
The spelling of 1102121202 in words is "one billion, one hundred two million, one hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •