Base | Representation |
---|---|
bin | 11011100000110100000110… |
… | …011110100011011101111100 |
3 | 120212102200212220212011011201 |
4 | 123200310012132203131330 |
5 | 111330000022402144400 |
6 | 1105203353055025244 |
7 | 34326056604203035 |
oct | 3340640636433574 |
9 | 525380786764151 |
10 | 121002222303100 |
11 | 35611832a72336 |
12 | 116a305b50b224 |
13 | 52695cac35658 |
14 | 21c47786bba8c |
15 | dec82b04206a |
hex | 6e0d067a377c |
121002222303100 has 36 divisors (see below), whose sum is σ = 262576048847224. Its totient is φ = 48400662847680.
The previous prime is 121002222303049. The next prime is 121002222303101. The reversal of 121002222303100 is 1303222200121.
It is a super-2 number, since 2×1210022223031002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121002222303101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19573822 + ... + 25002778.
Almost surely, 2121002222303100 is an apocalyptic number.
121002222303100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121002222303100 is an abundant number, since it is smaller than the sum of its proper divisors (141573826544124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121002222303100 is a wasteful number, since it uses less digits than its factorization.
121002222303100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5651854 (or 5651847 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 121002222303100 its reverse (1303222200121), we get a palindrome (122305444503221).
The spelling of 121002222303100 in words is "one hundred twenty-one trillion, two billion, two hundred twenty-two million, three hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •