Base | Representation |
---|---|
bin | 10010110111110101… |
… | …11110101011000111 |
3 | 222011010101010212022 |
4 | 21123322332223013 |
5 | 131222310403221 |
6 | 4353222313355 |
7 | 506040422123 |
oct | 113372765307 |
9 | 28133333768 |
10 | 10132122311 |
11 | 432a356503 |
12 | 1b6928885b |
13 | c56199c5c |
14 | 6c1916583 |
15 | 3e47aa4ab |
hex | 25bebeac7 |
10132122311 has 4 divisors (see below), whose sum is σ = 10572649392. Its totient is φ = 9691595232.
The previous prime is 10132122277. The next prime is 10132122347. The reversal of 10132122311 is 11322123101.
10132122311 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 a de Polignac number, because none of the positive numbers 2k-10132122311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10132122311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132122211) 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, 220263506 + ... + 220263551.
It is an arithmetic number, because the mean of its divisors is an integer number (2643162348).
Almost surely, 210132122311 is an apocalyptic number.
10132122311 is a deficient number, since it is larger than the sum of its proper divisors (440527081).
10132122311 is an equidigital number, since it uses as much as digits as its factorization.
10132122311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440527080.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10132122311 its reverse (11322123101), we get a palindrome (21454245412).
The spelling of 10132122311 in words is "ten billion, one hundred thirty-two million, one hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •