Base | Representation |
---|---|
bin | 110100001010001010… |
… | …0101000010011101001 |
3 | 101201010011202201221001 |
4 | 1220110110220103221 |
5 | 3313344041230433 |
6 | 123242353115001 |
7 | 11043500105056 |
oct | 1502424502351 |
9 | 351104681831 |
10 | 112010101993 |
11 | 43559867529 |
12 | 1985bb58a61 |
13 | a740aa037a |
14 | 55c814c02d |
15 | 2da880357d |
hex | 1a145284e9 |
112010101993 has 8 divisors (see below), whose sum is σ = 118622946312. Its totient is φ = 105399926016.
The previous prime is 112010101991. The next prime is 112010101997. The reversal of 112010101993 is 399101010211.
It can be written as a sum of positive squares in 4 ways, for example, as 27382637529 + 84627464464 = 165477^2 + 290908^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112010101993 - 21 = 112010101991 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112010101991) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 580330 + ... + 748867.
It is an arithmetic number, because the mean of its divisors is an integer number (14827868289).
Almost surely, 2112010101993 is an apocalyptic number.
It is an amenable number.
112010101993 is a deficient number, since it is larger than the sum of its proper divisors (6612844319).
112010101993 is a wasteful number, since it uses less digits than its factorization.
112010101993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334171.
The product of its (nonzero) digits is 486, while the sum is 28.
The spelling of 112010101993 in words is "one hundred twelve billion, ten million, one hundred one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •