Base | Representation |
---|---|
bin | 10001110101000000110… |
… | …011111010111110100100 |
3 | 11100010100000120112100221 |
4 | 101311000303322332210 |
5 | 130033103134011400 |
6 | 2334454425214124 |
7 | 154341301643104 |
oct | 21650063727644 |
9 | 4303300515327 |
10 | 1225153032100 |
11 | 432647a46428 |
12 | 179539331344 |
13 | 8b6ba74225a |
14 | 43424d49204 |
15 | 21d0803ac1a |
hex | 11d40cfafa4 |
1225153032100 has 72 divisors (see below), whose sum is σ = 2672892118400. Its totient is φ = 487425185280.
The previous prime is 1225153032023. The next prime is 1225153032137. The reversal of 1225153032100 is 12303515221.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 65919409 + ... + 65937991.
Almost surely, 21225153032100 is an apocalyptic number.
1225153032100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1225153032100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1336446059200).
1225153032100 is an abundant number, since it is smaller than the sum of its proper divisors (1447739086300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1225153032100 is a wasteful number, since it uses less digits than its factorization.
1225153032100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22109 (or 22102 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 1225153032100 its reverse (12303515221), we get a palindrome (1237456547321).
The spelling of 1225153032100 in words is "one trillion, two hundred twenty-five billion, one hundred fifty-three million, thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •