Base | Representation |
---|---|
bin | 10001110011000000100… |
… | …011000100100001011100 |
3 | 11022220210001101122010220 |
4 | 101303000203010201130 |
5 | 130014201242143400 |
6 | 2333501114401340 |
7 | 154234052043210 |
oct | 21630043044134 |
9 | 4286701348126 |
10 | 1223001131100 |
11 | 431743289351 |
12 | 179038730250 |
13 | 8b436981958 |
14 | 4329d22c940 |
15 | 21c2e1707a0 |
hex | 11cc08c485c |
1223001131100 has 144 divisors (see below), whose sum is σ = 4067434334208. Its totient is φ = 277927176960.
The previous prime is 1223001131081. The next prime is 1223001131101. The reversal of 1223001131100 is 11311003221.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1223001131100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223001131101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1319884 + ... + 2046483.
Almost surely, 21223001131100 is an apocalyptic number.
1223001131100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1223001131100 is an abundant number, since it is smaller than the sum of its proper divisors (2844433203108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1223001131100 is a wasteful number, since it uses less digits than its factorization.
1223001131100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3366564 (or 3366557 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1223001131100 its reverse (11311003221), we get a palindrome (1234312134321).
The spelling of 1223001131100 in words is "one trillion, two hundred twenty-three billion, one million, one hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •