Base | Representation |
---|---|
bin | 1011010000000100010100… |
… | …1111111100101111000000 |
3 | 1121210121212002121020200102 |
4 | 2310001011033330233000 |
5 | 3110140111402340222 |
6 | 42151001203341532 |
7 | 2414515450552340 |
oct | 264010517745700 |
9 | 47717762536612 |
10 | 12370667621312 |
11 | 3a3a409407a20 |
12 | 14796276818a8 |
13 | 6b971a079620 |
14 | 30aa5a282d20 |
15 | 166bc9618d92 |
hex | b40453fcbc0 |
12370667621312 has 448 divisors, whose sum is σ = 33516882846720. Its totient is φ = 4374333849600.
The previous prime is 12370667621297. The next prime is 12370667621371. The reversal of 12370667621312 is 21312676607321.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (448).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1032000983 + ... + 1032012969.
It is an arithmetic number, because the mean of its divisors is an integer number (74814470640).
Almost surely, 212370667621312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12370667621312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16758441423360).
12370667621312 is an abundant number, since it is smaller than the sum of its proper divisors (21146215225408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12370667621312 is a wasteful number, since it uses less digits than its factorization.
12370667621312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12300 (or 12290 counting only the distinct ones).
The product of its (nonzero) digits is 762048, while the sum is 47.
The spelling of 12370667621312 in words is "twelve trillion, three hundred seventy billion, six hundred sixty-seven million, six hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •