Base | Representation |
---|---|
bin | 1001001101000100011001… |
… | …0110010110010111110111 |
3 | 1022211110210210020202012111 |
4 | 2103101012112112113313 |
5 | 2311302003020311203 |
6 | 33305042002231451 |
7 | 2063104041663205 |
oct | 223210626262767 |
9 | 38743723222174 |
10 | 10120123213303 |
11 | 3251a137a5114 |
12 | 1175420955587 |
13 | 585428a2326c |
14 | 26db6098a075 |
15 | 1283aab3626d |
hex | 934465965f7 |
10120123213303 has 4 divisors (see below), whose sum is σ = 10242052408728. Its totient is φ = 9998194017880.
The previous prime is 10120123213271. The next prime is 10120123213307. The reversal of 10120123213303 is 30331232102101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10120123213303 - 25 = 10120123213271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120123213307) 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 3 ways as a sum of consecutive naturals, for example, 60964597588 + ... + 60964597753.
It is an arithmetic number, because the mean of its divisors is an integer number (2560513102182).
Almost surely, 210120123213303 is an apocalyptic number.
10120123213303 is a deficient number, since it is larger than the sum of its proper divisors (121929195425).
10120123213303 is an equidigital number, since it uses as much as digits as its factorization.
10120123213303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121929195424.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10120123213303 its reverse (30331232102101), we get a palindrome (40451355315404).
The spelling of 10120123213303 in words is "ten trillion, one hundred twenty billion, one hundred twenty-three million, two hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •