Base | Representation |
---|---|
bin | 1101011000110… |
… | …01011110111010 |
3 | 21211022112101201 |
4 | 12230121132322 |
5 | 212222131020 |
6 | 15051004414 |
7 | 2532360052 |
oct | 654313672 |
9 | 254275351 |
10 | 112302010 |
11 | 58434187 |
12 | 3173970a |
13 | 1a3600c2 |
14 | 10cb4562 |
15 | 9cd4a0a |
hex | 6b197ba |
112302010 has 8 divisors (see below), whose sum is σ = 202143636. Its totient is φ = 44920800.
The previous prime is 112301971. The next prime is 112302013. The reversal of 112302010 is 10203211.
It can be written as a sum of positive squares in 2 ways, for example, as 103367889 + 8934121 = 10167^2 + 2989^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1123020102 = 25223482900080200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 11230201 = 112302010 / (1 + 1 + 2 + 3 + 0 + 2 + 0 + 1 + 0).
It is not an unprimeable number, because it can be changed into a prime (112302013) 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, 5615091 + ... + 5615110.
Almost surely, 2112302010 is an apocalyptic number.
112302010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112302010 is a deficient number, since it is larger than the sum of its proper divisors (89841626).
112302010 is a wasteful number, since it uses less digits than its factorization.
112302010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11230208.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 112302010 is about 10597.2642696122. The cubic root of 112302010 is about 482.4613300910.
Adding to 112302010 its reverse (10203211), we get a palindrome (122505221).
The spelling of 112302010 in words is "one hundred twelve million, three hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •