Base | Representation |
---|---|
bin | 1011000111110101111010… |
… | …1011111010010101000000 |
3 | 1121022010010011020202020210 |
4 | 2301331132223322111000 |
5 | 3100331212234223440 |
6 | 42002031324434120 |
7 | 2401353644531355 |
oct | 261753653722500 |
9 | 47263104222223 |
10 | 12229360461120 |
11 | 3995496186000 |
12 | 14561700a8940 |
13 | 6a92ba74357a |
14 | 303c931cc62c |
15 | 1631a8c90a80 |
hex | b1f5eafa540 |
12229360461120 has 896 divisors, whose sum is σ = 43324448735232. Its totient is φ = 2922310533120.
The previous prime is 12229360461119. The next prime is 12229360461151. The reversal of 12229360461120 is 2116406392221.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 47585060032 + ... + 47585060288.
It is an arithmetic number, because the mean of its divisors is an integer number (48353179392).
Almost surely, 212229360461120 is an apocalyptic number.
12229360461120 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 12229360461120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21662224367616).
12229360461120 is an abundant number, since it is smaller than the sum of its proper divisors (31095088274112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12229360461120 is a wasteful number, since it uses less digits than its factorization.
12229360461120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700 (or 668 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 39.
The spelling of 12229360461120 in words is "twelve trillion, two hundred twenty-nine billion, three hundred sixty million, four hundred sixty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •