Base | Representation |
---|---|
bin | 1001011000001011101010… |
… | …0110010010100111110011 |
3 | 1100111201121221122122201212 |
4 | 2112002322212102213303 |
5 | 2322414013320012243 |
6 | 33532455411150335 |
7 | 2112643324556636 |
oct | 226027246224763 |
9 | 40451557578655 |
10 | 10311052110323 |
11 | 3315990120398 |
12 | 11a64265a53ab |
13 | 59a435928583 |
14 | 2790b4027c1d |
15 | 12d332a36318 |
hex | 960ba9929f3 |
10311052110323 has 4 divisors (see below), whose sum is σ = 10323055664280. Its totient is φ = 10299048556368.
The previous prime is 10311052110283. The next prime is 10311052110329. The reversal of 10311052110323 is 32301125011301.
10311052110323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10311052110323 - 212 = 10311052106227 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10311052110329) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6001775690 + ... + 6001777407.
It is an arithmetic number, because the mean of its divisors is an integer number (2580763916070).
Almost surely, 210311052110323 is an apocalyptic number.
10311052110323 is a deficient number, since it is larger than the sum of its proper divisors (12003553957).
10311052110323 is an equidigital number, since it uses as much as digits as its factorization.
10311052110323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12003553956.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 10311052110323 its reverse (32301125011301), we get a palindrome (42612177121624).
The spelling of 10311052110323 in words is "ten trillion, three hundred eleven billion, fifty-two million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •