Base | Representation |
---|---|
bin | 11001011101111101011110… |
… | …000011001111111010011101 |
3 | 112200121001110120122120001121 |
4 | 121131331132003033322131 |
5 | 104140133020141203201 |
6 | 1034120410351010541 |
7 | 32410312651020265 |
oct | 3135753603177235 |
9 | 480531416576047 |
10 | 112010030022301 |
11 | 32765206941204 |
12 | 10690364509a51 |
13 | 4a66667805168 |
14 | 1d9345892a7a5 |
15 | ce398802d9a1 |
hex | 65df5e0cfe9d |
112010030022301 has 4 divisors (see below), whose sum is σ = 112010102949472. Its totient is φ = 112009957095132.
The previous prime is 112010030022271. The next prime is 112010030022311. The reversal of 112010030022301 is 103220030010211.
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 112010030022301 - 217 = 112010029891229 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 (112010030022311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34109031 + ... + 37248436.
It is an arithmetic number, because the mean of its divisors is an integer number (28002525737368).
Almost surely, 2112010030022301 is an apocalyptic number.
It is an amenable number.
112010030022301 is a deficient number, since it is larger than the sum of its proper divisors (72927171).
112010030022301 is an equidigital number, since it uses as much as digits as its factorization.
112010030022301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72927170.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 112010030022301 its reverse (103220030010211), we get a palindrome (215230060032512).
The spelling of 112010030022301 in words is "one hundred twelve trillion, ten billion, thirty million, twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •