Base | Representation |
---|---|
bin | 1001011000001111010001… |
… | …0111001111110100010000 |
3 | 1100111211010111020210212012 |
4 | 2112003310113033310100 |
5 | 2322423004414321300 |
6 | 33533135511122052 |
7 | 2113006333230023 |
oct | 226036427176420 |
9 | 40454114223765 |
10 | 10312021245200 |
11 | 3316338182804 |
12 | 11a6657073328 |
13 | 59a55b649a6c |
14 | 279166a1d1ba |
15 | 12d38cb6c435 |
hex | 960f45cfd10 |
10312021245200 has 30 divisors (see below), whose sum is σ = 24774631042554. Its totient is φ = 4124808497920.
The previous prime is 10312021245191. The next prime is 10312021245269. The reversal of 10312021245200 is 254212021301.
It can be written as a sum of positive squares in 3 ways, for example, as 3214762936576 + 7097258308624 = 1792976^2 + 2664068^2 .
It is a super-2 number, since 2×103120212452002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12890026157 + ... + 12890026956.
Almost surely, 210312021245200 is an apocalyptic number.
10312021245200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10312021245200 is an abundant number, since it is smaller than the sum of its proper divisors (14462609797354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10312021245200 is a wasteful number, since it uses less digits than its factorization.
10312021245200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25780053131 (or 25780053120 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 10312021245200 its reverse (254212021301), we get a palindrome (10566233266501).
The spelling of 10312021245200 in words is "ten trillion, three hundred twelve billion, twenty-one million, two hundred forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •