Base | Representation |
---|---|
bin | 1001011000010010111101… |
… | …1011110110111111110000 |
3 | 1100111220200120010010011220 |
4 | 2112010233123312333300 |
5 | 2322432022122410000 |
6 | 33533422113105040 |
7 | 2113043026154541 |
oct | 226045733667760 |
9 | 40456616103156 |
10 | 10313012310000 |
11 | 33167a6653424 |
12 | 11a6892b58180 |
13 | 59a688a78c3a |
14 | 27921c4c24c8 |
15 | 12d3e9b861a0 |
hex | 9612f6f6ff0 |
10313012310000 has 100 divisors (see below), whose sum is σ = 33291778901832. Its totient is φ = 2750136608000.
The previous prime is 10313012309989. The next prime is 10313012310017. The reversal of 10313012310000 is 1321031301.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×103130123100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 171853539 + ... + 171913538.
Almost surely, 210313012310000 is an apocalyptic number.
10313012310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10313012310000 is an abundant number, since it is smaller than the sum of its proper divisors (22978766591832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10313012310000 is an equidigital number, since it uses as much as digits as its factorization.
10313012310000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343767108 (or 343767087 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 10313012310000 its reverse (1321031301), we get a palindrome (10314333341301).
The spelling of 10313012310000 in words is "ten trillion, three hundred thirteen billion, twelve million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •