Base | Representation |
---|---|
bin | 1001011000001011110110… |
… | …1000110110010001101111 |
3 | 1100111201202111121211022002 |
4 | 2112002331220312101233 |
5 | 2322414114344043203 |
6 | 33532504432242515 |
7 | 2112644514226520 |
oct | 226027550662157 |
9 | 40451674554262 |
10 | 10311103112303 |
11 | 3315a06995994 |
12 | 11a643b6a043b |
13 | 59a443374a66 |
14 | 2790bab02847 |
15 | 12d33725cd88 |
hex | 960bda3646f |
10311103112303 has 16 divisors (see below), whose sum is σ = 11885634109440. Its totient is φ = 8762227547136.
The previous prime is 10311103112269. The next prime is 10311103112353. The reversal of 10311103112303 is 30321130111301.
It is not a de Polignac number, because 10311103112303 - 216 = 10311103046767 is a prime.
It is a super-2 number, since 2×103111031123032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311103112353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11067218 + ... + 11962671.
It is an arithmetic number, because the mean of its divisors is an integer number (742852131840).
Almost surely, 210311103112303 is an apocalyptic number.
10311103112303 is a deficient number, since it is larger than the sum of its proper divisors (1574530997137).
10311103112303 is a wasteful number, since it uses less digits than its factorization.
10311103112303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23030446.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 10311103112303 its reverse (30321130111301), we get a palindrome (40632233223604).
The spelling of 10311103112303 in words is "ten trillion, three hundred eleven billion, one hundred three million, one hundred twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •