Base | Representation |
---|---|
bin | 110100001001111101… |
… | …0000010011010001101 |
3 | 101201002200122120112220 |
4 | 1220103322002122031 |
5 | 3313340300143041 |
6 | 123241543445553 |
7 | 11043353622405 |
oct | 1502372023215 |
9 | 351080576486 |
10 | 112003131021 |
11 | 435559360a1 |
12 | 198597568b9 |
13 | a73c4cc432 |
14 | 55c7255805 |
15 | 2da7dc7d66 |
hex | 1a13e8268d |
112003131021 has 4 divisors (see below), whose sum is σ = 149337508032. Its totient is φ = 74668754012.
The previous prime is 112003131001. The next prime is 112003131043. The reversal of 112003131021 is 120131300211.
It is a happy number.
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 112003131021 - 27 = 112003130893 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112003131001) 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, 18667188501 + ... + 18667188506.
It is an arithmetic number, because the mean of its divisors is an integer number (37334377008).
Almost surely, 2112003131021 is an apocalyptic number.
It is an amenable number.
112003131021 is a deficient number, since it is larger than the sum of its proper divisors (37334377011).
112003131021 is an equidigital number, since it uses as much as digits as its factorization.
112003131021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37334377010.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 112003131021 its reverse (120131300211), we get a palindrome (232134431232).
The spelling of 112003131021 in words is "one hundred twelve billion, three million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •