Base | Representation |
---|---|
bin | 10100101011011000… |
… | …01001010001111011 |
3 | 1001122200002002100021 |
4 | 22111230021101323 |
5 | 140213413441443 |
6 | 5033323351311 |
7 | 542046411316 |
oct | 122554112173 |
9 | 31580062307 |
10 | 11101312123 |
11 | 4787446120 |
12 | 2199982537 |
13 | 107bc0a455 |
14 | 77452397d |
15 | 44e9029ed |
hex | 295b0947b |
11101312123 has 16 divisors (see below), whose sum is σ = 12210831360. Its totient is φ = 10008835200.
The previous prime is 11101312099. The next prime is 11101312129. The reversal of 11101312123 is 32121310111.
It is a happy number.
11101312123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11101312123 - 25 = 11101312091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101312097 and 11101312106.
It is not an unprimeable number, because it can be changed into a prime (11101312129) 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 in 15 ways as a sum of consecutive naturals, for example, 700198 + ... + 715876.
It is an arithmetic number, because the mean of its divisors is an integer number (763176960).
Almost surely, 211101312123 is an apocalyptic number.
11101312123 is a deficient number, since it is larger than the sum of its proper divisors (1109519237).
11101312123 is a wasteful number, since it uses less digits than its factorization.
11101312123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16218.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11101312123 its reverse (32121310111), we get a palindrome (43222622234).
The spelling of 11101312123 in words is "eleven billion, one hundred one million, three hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •