Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0001001101000001101 |
3 | 101201002121201210201212 |
4 | 1220103312021220031 |
5 | 3313340020041023 |
6 | 123241505544205 |
7 | 11043342146501 |
oct | 1502366115015 |
9 | 351077653655 |
10 | 112002112013 |
11 | 435552aa540 |
12 | 19859345065 |
13 | a73c23367c |
14 | 55c706c301 |
15 | 2da7c75e78 |
hex | 1a13d89a0d |
112002112013 has 4 divisors (see below), whose sum is σ = 122184122208. Its totient is φ = 101820101820.
The previous prime is 112002111967. The next prime is 112002112031. The reversal of 112002112013 is 310211200211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112002112013 - 226 = 111935003149 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112002112043) 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 3 ways as a sum of consecutive naturals, for example, 5091005081 + ... + 5091005102.
It is an arithmetic number, because the mean of its divisors is an integer number (30546030552).
Almost surely, 2112002112013 is an apocalyptic number.
It is an amenable number.
112002112013 is a deficient number, since it is larger than the sum of its proper divisors (10182010195).
112002112013 is a wasteful number, since it uses less digits than its factorization.
112002112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10182010194.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 112002112013 its reverse (310211200211), we get a palindrome (422213312224).
The spelling of 112002112013 in words is "one hundred twelve billion, two million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •