Base | Representation |
---|---|
bin | 110100001010100001… |
… | …0000100000001101101 |
3 | 101201011000011211101220 |
4 | 1220111002010001231 |
5 | 3313410113341023 |
6 | 123243500253553 |
7 | 11044003251132 |
oct | 1502502040155 |
9 | 351130154356 |
10 | 112022012013 |
11 | 4356556171a |
12 | 19863b412b9 |
13 | a7433b0412 |
14 | 55c996c589 |
15 | 2da98a73e3 |
hex | 1a1508406d |
112022012013 has 16 divisors (see below), whose sum is σ = 150251811840. Its totient is φ = 74236925504.
The previous prime is 112022011999. The next prime is 112022012017. The reversal of 112022012013 is 310210220211.
It is a cyclic number.
It is not a de Polignac number, because 112022012013 - 28 = 112022011757 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112022011983 and 112022012001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112022012017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3749428 + ... + 3779186.
It is an arithmetic number, because the mean of its divisors is an integer number (9390738240).
Almost surely, 2112022012013 is an apocalyptic number.
It is an amenable number.
112022012013 is a deficient number, since it is larger than the sum of its proper divisors (38229799827).
112022012013 is a wasteful number, since it uses less digits than its factorization.
112022012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37188.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 112022012013 its reverse (310210220211), we get a palindrome (422232232224).
The spelling of 112022012013 in words is "one hundred twelve billion, twenty-two million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •