Base | Representation |
---|---|
bin | 10010110110101001… |
… | …10111001110000111 |
3 | 222010102120111102020 |
4 | 21123110313032013 |
5 | 131212231132221 |
6 | 4352224214223 |
7 | 505556454666 |
oct | 113324671607 |
9 | 28112514366 |
10 | 10122130311 |
11 | 4324751357 |
12 | 1b65a6a373 |
13 | c540abc27 |
14 | 6c0474ddd |
15 | 3e3984ac6 |
hex | 25b537387 |
10122130311 has 4 divisors (see below), whose sum is σ = 13496173752. Its totient is φ = 6748086872.
The previous prime is 10122130301. The next prime is 10122130313. The reversal of 10122130311 is 11303122101.
It is a happy number.
10122130311 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10122130311 - 26 = 10122130247 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122130313) 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 3 ways as a sum of consecutive naturals, for example, 1687021716 + ... + 1687021721.
It is an arithmetic number, because the mean of its divisors is an integer number (3374043438).
Almost surely, 210122130311 is an apocalyptic number.
10122130311 is a deficient number, since it is larger than the sum of its proper divisors (3374043441).
10122130311 is an equidigital number, since it uses as much as digits as its factorization.
10122130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3374043440.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10122130311 its reverse (11303122101), we get a palindrome (21425252412).
The spelling of 10122130311 in words is "ten billion, one hundred twenty-two million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •