Base | Representation |
---|---|
bin | 1001001101000011111110… |
… | …1010010010100111110111 |
3 | 1022211110111222002201220202 |
4 | 2103100333222102213313 |
5 | 2311301240304002221 |
6 | 33305022513151115 |
7 | 2063101210123502 |
oct | 223207752224767 |
9 | 38743458081822 |
10 | 10120011000311 |
11 | 3251966421903 |
12 | 11753ab25b49b |
13 | 58540b6c4844 |
14 | 26db4dada139 |
15 | 1283a0d6cd0b |
hex | 9343fa929f7 |
10120011000311 has 4 divisors (see below), whose sum is σ = 10120556836824. Its totient is φ = 10119465163800.
The previous prime is 10120011000227. The next prime is 10120011000329. The reversal of 10120011000311 is 11300011002101.
It is a happy number.
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 10120011000311 - 230 = 10118937258487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10120011000292 and 10120011000301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120011000611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272890445 + ... + 272927526.
It is an arithmetic number, because the mean of its divisors is an integer number (2530139209206).
Almost surely, 210120011000311 is an apocalyptic number.
10120011000311 is a deficient number, since it is larger than the sum of its proper divisors (545836513).
10120011000311 is an equidigital number, since it uses as much as digits as its factorization.
10120011000311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545836512.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10120011000311 its reverse (11300011002101), we get a palindrome (21420022002412).
The spelling of 10120011000311 in words is "ten trillion, one hundred twenty billion, eleven million, three hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •