Base | Representation |
---|---|
bin | 100001001001000… |
… | …0011110000010110 |
3 | 2212111110222200211 |
4 | 1002102003300112 |
5 | 4234134431410 |
6 | 302202400034 |
7 | 36362046433 |
oct | 10222036026 |
9 | 2774428624 |
10 | 1112030230 |
11 | 520791853 |
12 | 27050001a |
13 | 14950366c |
14 | a7990b8a |
15 | 6796068a |
hex | 42483c16 |
1112030230 has 64 divisors (see below), whose sum is σ = 2129587200. Its totient is φ = 417432960.
The previous prime is 1112030191. The next prime is 1112030237. The reversal of 1112030230 is 320302111.
It is a super-2 number, since 2×11120302302 = 2473222464867705800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1112030230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112030237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1762015 + ... + 1762645.
It is an arithmetic number, because the mean of its divisors is an integer number (33274800).
Almost surely, 21112030230 is an apocalyptic number.
1112030230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1112030230 is a deficient number, since it is larger than the sum of its proper divisors (1017556970).
1112030230 is a wasteful number, since it uses less digits than its factorization.
1112030230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 829.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1112030230 is about 33347.1172667144. The cubic root of 1112030230 is about 1036.0296815485.
Adding to 1112030230 its reverse (320302111), we get a palindrome (1432332341).
The spelling of 1112030230 in words is "one billion, one hundred twelve million, thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •