Base | Representation |
---|---|
bin | 1001011000010000000001… |
… | …0101000111011010101111 |
3 | 1100111211122111000212122110 |
4 | 2112010000111013122233 |
5 | 2322423412313404403 |
6 | 33533211442215103 |
7 | 2113014321563133 |
oct | 226040025073257 |
9 | 40454574025573 |
10 | 10312222013103 |
11 | 331643053a69a |
12 | 11a66b2354493 |
13 | 59a59111273a |
14 | 2791855613c3 |
15 | 12d3a05c9103 |
hex | 961005476af |
10312222013103 has 16 divisors (see below), whose sum is σ = 13805662139136. Its totient is φ = 6846803256000.
The previous prime is 10312222013053. The next prime is 10312222013201. The reversal of 10312222013103 is 30131022221301.
It is not a de Polignac number, because 10312222013103 - 214 = 10312221996719 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10312222013103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10312222014103) 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 15 ways as a sum of consecutive naturals, for example, 7751926 + ... + 8984252.
It is an arithmetic number, because the mean of its divisors is an integer number (862853883696).
Almost surely, 210312222013103 is an apocalyptic number.
10312222013103 is a deficient number, since it is larger than the sum of its proper divisors (3493440126033).
10312222013103 is a wasteful number, since it uses less digits than its factorization.
10312222013103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1243694.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10312222013103 its reverse (30131022221301), we get a palindrome (40443244234404).
The spelling of 10312222013103 in words is "ten trillion, three hundred twelve billion, two hundred twenty-two million, thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •