Base | Representation |
---|---|
bin | 1001011000001000001001… |
… | …1101101001010110000000 |
3 | 1100111122012022111202021210 |
4 | 2112002002131221112000 |
5 | 2322410101220220000 |
6 | 33532222125250120 |
7 | 2112611100515361 |
oct | 226020235512600 |
9 | 40448168452253 |
10 | 10310110320000 |
11 | 3315547545387 |
12 | 11a6203103940 |
13 | 59a31578c4aa |
14 | 279024d0db68 |
15 | 12d2ca002350 |
hex | 96082769580 |
10310110320000 has 160 divisors (see below), whose sum is σ = 34221834476280. Its totient is φ = 2749362688000.
The previous prime is 10310110319947. The next prime is 10310110320007. The reversal of 10310110320000 is 2301101301.
It is a tau number, because it is divible by the number of its divisors (160).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310110320007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 21239397 + ... + 21719396.
Almost surely, 210310110320000 is an apocalyptic number.
10310110320000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10310110320000 is an abundant number, since it is smaller than the sum of its proper divisors (23911724156280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10310110320000 is an frugal number, since it uses more digits than its factorization.
10310110320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42958830 (or 42958803 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10310110320000 its reverse (2301101301), we get a palindrome (10312411421301).
The spelling of 10310110320000 in words is "ten trillion, three hundred ten billion, one hundred ten million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •