Base | Representation |
---|---|
bin | 1001011000010000000001… |
… | …1001010001000011000011 |
3 | 1100111211122120002011010111 |
4 | 2112010000121101003003 |
5 | 2322423413103213443 |
6 | 33533211521412151 |
7 | 2113014334044166 |
oct | 226040031210303 |
9 | 40454576064114 |
10 | 10312223101123 |
11 | 3316431113089 |
12 | 11a66b279a057 |
13 | 59a591403a38 |
14 | 279185765add |
15 | 12d3a074169d |
hex | 961006510c3 |
10312223101123 has 16 divisors (see below), whose sum is σ = 10616448578400. Its totient is φ = 10012165196800.
The previous prime is 10312223100989. The next prime is 10312223101129. The reversal of 10312223101123 is 32110132221301.
It is a cyclic number.
It is not a de Polignac number, because 10312223101123 - 213 = 10312223092931 is a prime.
It is a super-2 number, since 2×103122231011232 (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 = 10312223101094 and 10312223101103.
It is not an unprimeable number, because it can be changed into a prime (10312223101129) 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, 9601908 + ... + 10621726.
It is an arithmetic number, because the mean of its divisors is an integer number (663528036150).
Almost surely, 210312223101123 is an apocalyptic number.
10312223101123 is a deficient number, since it is larger than the sum of its proper divisors (304225477277).
10312223101123 is a wasteful number, since it uses less digits than its factorization.
10312223101123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1021862.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10312223101123 its reverse (32110132221301), we get a palindrome (42422355322424).
The spelling of 10312223101123 in words is "ten trillion, three hundred twelve billion, two hundred twenty-three million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •