Base | Representation |
---|---|
bin | 110100001010110110… |
… | …0110010111100000010 |
3 | 101201011210020221221002 |
4 | 1220111230302330002 |
5 | 3313421000323320 |
6 | 123244540332002 |
7 | 11044200415451 |
oct | 1502554627402 |
9 | 351153227832 |
10 | 112033214210 |
11 | 43570913035 |
12 | 19867844002 |
13 | a745803238 |
14 | 55cb246b98 |
15 | 2daa86b675 |
hex | 1a15b32f02 |
112033214210 has 8 divisors (see below), whose sum is σ = 201659785596. Its totient is φ = 44813285680.
The previous prime is 112033214201. The next prime is 112033214213. The reversal of 112033214210 is 12412330211.
112033214210 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 111181566721 + 851647489 = 333439^2 + 29183^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (112033214213) 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, 5601660701 + ... + 5601660720.
Almost surely, 2112033214210 is an apocalyptic number.
112033214210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112033214210 is a deficient number, since it is larger than the sum of its proper divisors (89626571386).
112033214210 is a wasteful number, since it uses less digits than its factorization.
112033214210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11203321428.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112033214210 its reverse (12412330211), we get a palindrome (124445544421).
The spelling of 112033214210 in words is "one hundred twelve billion, thirty-three million, two hundred fourteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.520 sec. • engine limits •