Base | Representation |
---|---|
bin | 10010110101010110… |
… | …10010110001001101 |
3 | 222002200001212020212 |
4 | 21122223102301031 |
5 | 131201433424401 |
6 | 4351154452205 |
7 | 505365030464 |
oct | 113253226115 |
9 | 28080055225 |
10 | 10111233101 |
11 | 43195890a2 |
12 | 1b62294065 |
13 | c51a64b88 |
14 | 6bcc399db |
15 | 3e2a30dbb |
hex | 25aad2c4d |
10111233101 has 2 divisors, whose sum is σ = 10111233102. Its totient is φ = 10111233100.
The previous prime is 10111233091. The next prime is 10111233161. The reversal of 10111233101 is 10133211101.
It is a happy number.
10111233101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6379855876 + 3731377225 = 79874^2 + 61085^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111233101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111233161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055616550 + 5055616551.
It is an arithmetic number, because the mean of its divisors is an integer number (5055616551).
Almost surely, 210111233101 is an apocalyptic number.
It is an amenable number.
10111233101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111233101 is an equidigital number, since it uses as much as digits as its factorization.
10111233101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10111233101 its reverse (10133211101), we get a palindrome (20244444202).
The spelling of 10111233101 in words is "ten billion, one hundred eleven million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •