Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …011100110110100110100 |
3 | 10220100222021212100121111 |
4 | 100002200103212310310 |
5 | 121024301441401400 |
6 | 2202202203124404 |
7 | 142426366646101 |
oct | 20024023466464 |
9 | 3810867770544 |
10 | 1102201122100 |
11 | 395493887671 |
12 | 159744b13704 |
13 | 7cc24b105a0 |
14 | 3b4bd957aa8 |
15 | 1da0dd403ba |
hex | 100a04e6d34 |
1102201122100 has 72 divisors (see below), whose sum is σ = 2599390390520. Its totient is φ = 403232878080.
The previous prime is 1102201122079. The next prime is 1102201122101. The reversal of 1102201122100 is 12211022011.
It can be written as a sum of positive squares in 12 ways, for example, as 147992551204 + 954208570896 = 384698^2 + 976836^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102201122101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3747507 + ... + 4030906.
Almost surely, 21102201122100 is an apocalyptic number.
1102201122100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102201122100 is an abundant number, since it is smaller than the sum of its proper divisors (1497189268420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102201122100 is a wasteful number, since it uses less digits than its factorization.
1102201122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7778549 (or 7778542 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1102201122100 its reverse (12211022011), we get a palindrome (1114412144111).
The spelling of 1102201122100 in words is "one trillion, one hundred two billion, two hundred one million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •