Base | Representation |
---|---|
bin | 1001010111101110000101… |
… | …0001010111011110100111 |
3 | 1100110222010112001120001122 |
4 | 2111323201101113132213 |
5 | 2322301232404031043 |
6 | 33525103413444155 |
7 | 2112242460346460 |
oct | 225734121273647 |
9 | 40428115046048 |
10 | 10303111002023 |
11 | 3312585617174 |
12 | 11a498b04065b |
13 | 59976b664b18 |
14 | 27895d4cdd67 |
15 | 12d01a7c0368 |
hex | 95ee14577a7 |
10303111002023 has 16 divisors (see below), whose sum is σ = 11901550182720. Its totient is φ = 8736566169600.
The previous prime is 10303111001959. The next prime is 10303111002127. The reversal of 10303111002023 is 32020011130301.
It is a cyclic number.
It is not a de Polignac number, because 10303111002023 - 26 = 10303111001959 is a prime.
It is a super-2 number, since 2×103031110020232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10303111001992 and 10303111002010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10303111002523) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10044008 + ... + 11022173.
It is an arithmetic number, because the mean of its divisors is an integer number (743846886420).
Almost surely, 210303111002023 is an apocalyptic number.
10303111002023 is a deficient number, since it is larger than the sum of its proper divisors (1598439180697).
10303111002023 is a wasteful number, since it uses less digits than its factorization.
10303111002023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21066938.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10303111002023 its reverse (32020011130301), we get a palindrome (42323122132324).
The spelling of 10303111002023 in words is "ten trillion, three hundred three billion, one hundred eleven million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •