Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111110111100101001110 |
3 | 10220011100100221220100111 |
4 | 100000132113313211032 |
5 | 121010320411414410 |
6 | 2201202011550234 |
7 | 142321356635500 |
oct | 20003627674516 |
9 | 3804310856314 |
10 | 1100021201230 |
11 | 394575321876 |
12 | 159236a5b37a |
13 | 7c9682bc393 |
14 | 3b354225d70 |
15 | 1d93278cb8a |
hex | 1001e5f794e |
1100021201230 has 24 divisors (see below), whose sum is σ = 2303309699928. Its totient is φ = 377150125968.
The previous prime is 1100021201221. The next prime is 1100021201233. The reversal of 1100021201230 is 321021200011.
It is a self number, because there is not a number n which added to its sum of digits gives 1100021201230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100021201233) 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, 1122470124 + ... + 1122471103.
It is an arithmetic number, because the mean of its divisors is an integer number (95971237497).
Almost surely, 21100021201230 is an apocalyptic number.
1100021201230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100021201230 is an abundant number, since it is smaller than the sum of its proper divisors (1203288498698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100021201230 is a wasteful number, since it uses less digits than its factorization.
1100021201230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2244941248 (or 2244941241 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1100021201230 its reverse (321021200011), we get a palindrome (1421042401241).
The spelling of 1100021201230 in words is "one trillion, one hundred billion, twenty-one million, two hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •