Base | Representation |
---|---|
bin | 10001110100111000000… |
… | …000001011111100110000 |
3 | 11100002221201111112201201 |
4 | 101310320000023330300 |
5 | 130032302321034100 |
6 | 2334432025540544 |
7 | 154334525561356 |
oct | 21647000137460 |
9 | 4302851445651 |
10 | 1225005252400 |
11 | 432581590346 |
12 | 1794b7944754 |
13 | 8b695c3cb47 |
14 | 4340d47b7d6 |
15 | 21cea09936a |
hex | 11d3800bf30 |
1225005252400 has 120 divisors (see below), whose sum is σ = 2989875193280. Its totient is φ = 482249963520.
The previous prime is 1225005252377. The next prime is 1225005252409. The reversal of 1225005252400 is 42525005221.
It is not an unprimeable number, because it can be changed into a prime (1225005252409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9828874 + ... + 9952726.
Almost surely, 21225005252400 is an apocalyptic number.
1225005252400 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 1225005252400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1494937596640).
1225005252400 is an abundant number, since it is smaller than the sum of its proper divisors (1764869940880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1225005252400 is a wasteful number, since it uses less digits than its factorization.
1225005252400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124263 (or 124252 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
The spelling of 1225005252400 in words is "one trillion, two hundred twenty-five billion, five million, two hundred fifty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •