Base | Representation |
---|---|
bin | 1001011000001100000101… |
… | …0001001010111011101001 |
3 | 1100111201220202012222011002 |
4 | 2112003001101022323221 |
5 | 2322414230441424223 |
6 | 33532514445444345 |
7 | 2112646154001431 |
oct | 226030121127351 |
9 | 40451822188132 |
10 | 10311164014313 |
11 | 3315a38302528 |
12 | 11a6457b706b5 |
13 | 59a452b79456 |
14 | 2790c4c372c1 |
15 | 12d33c78ce28 |
hex | 960c144aee9 |
10311164014313 has 12 divisors (see below), whose sum is σ = 10552201632900. Its totient is φ = 10072044501792.
The previous prime is 10311164014303. The next prime is 10311164014357. The reversal of 10311164014313 is 31341046111301.
It can be written as a sum of positive squares in 2 ways, for example, as 8253623359744 + 2057540654569 = 2872912^2 + 1434413^2 .
It is a de Polignac number, because none of the positive numbers 2k-10311164014313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10311164014303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 843263 + ... + 4618811.
It is an arithmetic number, because the mean of its divisors is an integer number (879350136075).
Almost surely, 210311164014313 is an apocalyptic number.
It is an amenable number.
10311164014313 is a deficient number, since it is larger than the sum of its proper divisors (241037618587).
10311164014313 is an frugal number, since it uses more digits than its factorization.
10311164014313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3776056 (or 3775829 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 10311164014313 in words is "ten trillion, three hundred eleven billion, one hundred sixty-four million, fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •