Base | Representation |
---|---|
bin | 1001001101000100011001… |
… | …0010111000001101000111 |
3 | 1022211110210201112111220210 |
4 | 2103101012102320031013 |
5 | 2311302002302201203 |
6 | 33305041530530503 |
7 | 2063104031153145 |
oct | 223210622701507 |
9 | 38743721474823 |
10 | 10120122303303 |
11 | 3251a13233451 |
12 | 1175420596a33 |
13 | 585428794cbc |
14 | 26db607d0595 |
15 | 1283aaa06803 |
hex | 934464b8347 |
10120122303303 has 16 divisors (see below), whose sum is σ = 14287327900416. Its totient is φ = 6349837810560.
The previous prime is 10120122303293. The next prime is 10120122303311. The reversal of 10120122303303 is 30330322102101.
It is not a de Polignac number, because 10120122303303 - 25 = 10120122303271 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10120122303303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120122303103) 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, 8069550 + ... + 9238932.
It is an arithmetic number, because the mean of its divisors is an integer number (892957993776).
Almost surely, 210120122303303 is an apocalyptic number.
10120122303303 is a deficient number, since it is larger than the sum of its proper divisors (4167205597113).
10120122303303 is a wasteful number, since it uses less digits than its factorization.
10120122303303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339094.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10120122303303 its reverse (30330322102101), we get a palindrome (40450444405404).
The spelling of 10120122303303 in words is "ten trillion, one hundred twenty billion, one hundred twenty-two million, three hundred three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •