Base | Representation |
---|---|
bin | 11001011101110110111011… |
… | …110111010101101110100101 |
3 | 112200120101100121210220212102 |
4 | 121131312323313111232211 |
5 | 104140024133042232401 |
6 | 1034113250241501445 |
7 | 32406644046020114 |
oct | 3135667367255645 |
9 | 480511317726772 |
10 | 112003014024101 |
11 | 3276223655a992 |
12 | 1068ab26941885 |
13 | 4a65aba0ba435 |
14 | 1d92d90c07c7b |
15 | ce36c710456b |
hex | 65ddbbdd5ba5 |
112003014024101 has 16 divisors (see below), whose sum is σ = 118630881472896. Its totient is φ = 105379534557696.
The previous prime is 112003014024029. The next prime is 112003014024179. The reversal of 112003014024101 is 101420410300211.
It is a cyclic number.
It is not a de Polignac number, because 112003014024101 - 210 = 112003014023077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112003014020101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1029129650 + ... + 1029238476.
It is an arithmetic number, because the mean of its divisors is an integer number (7414430092056).
Almost surely, 2112003014024101 is an apocalyptic number.
It is an amenable number.
112003014024101 is a deficient number, since it is larger than the sum of its proper divisors (6627867448795).
112003014024101 is a wasteful number, since it uses less digits than its factorization.
112003014024101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128428.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 112003014024101 its reverse (101420410300211), we get a palindrome (213423424324312).
The spelling of 112003014024101 in words is "one hundred twelve trillion, three billion, fourteen million, twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •