Base | Representation |
---|---|
bin | 1011010000111101101110… |
… | …1110111010000110110100 |
3 | 1121212002122000111000220220 |
4 | 2310033123232322012310 |
5 | 3110413141232040200 |
6 | 42202030232454340 |
7 | 2415602353155666 |
oct | 264173356720664 |
9 | 47762560430826 |
10 | 12386077221300 |
11 | 3a459a6761522 |
12 | 148060824a3b0 |
13 | 6bb004718723 |
14 | 30b6bca4a536 |
15 | 1672cc38b4a0 |
hex | b43dbbba1b4 |
12386077221300 has 288 divisors, whose sum is σ = 36715207409664. Its totient is φ = 3222483264000.
The previous prime is 12386077221247. The next prime is 12386077221307. The reversal of 12386077221300 is 312277068321.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12386077221307) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 11332183554 + ... + 11332184646.
Almost surely, 212386077221300 is an apocalyptic number.
12386077221300 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 12386077221300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18357603704832).
12386077221300 is an abundant number, since it is smaller than the sum of its proper divisors (24329130188364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12386077221300 is a wasteful number, since it uses less digits than its factorization.
12386077221300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2959 (or 2952 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 42.
The spelling of 12386077221300 in words is "twelve trillion, three hundred eighty-six billion, seventy-seven million, two hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.236 sec. • engine limits •