Base | Representation |
---|---|
bin | 100011000110011101000… |
… | …110000000010010010000 |
3 | 22112121002020202021100202 |
4 | 203012131012000102100 |
5 | 304010001214000000 |
6 | 5044035320434332 |
7 | 336161250555215 |
oct | 43063506002220 |
9 | 8477066667322 |
10 | 2412112250000 |
11 | 84aa75532952 |
12 | 32b5976189a8 |
13 | 1465cc37973b |
14 | 84a6552db0c |
15 | 42b27e1add5 |
hex | 2319d180490 |
2412112250000 has 140 divisors (see below), whose sum is σ = 5845556425920. Its totient is φ = 964218000000.
The previous prime is 2412112249999. The next prime is 2412112250027. The reversal of 2412112250000 is 522112142.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 677748221 + ... + 677751779.
Almost surely, 22412112250000 is an apocalyptic number.
2412112250000 is a gapful number since it is divisible by the number (20) 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 2412112250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2922778212960).
2412112250000 is an abundant number, since it is smaller than the sum of its proper divisors (3433444175920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2412112250000 is an frugal number, since it uses more digits than its factorization.
2412112250000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6308 (or 6277 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 2412112250000 its reverse (522112142), we get a palindrome (2412634362142).
The spelling of 2412112250000 in words is "two trillion, four hundred twelve billion, one hundred twelve million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •