Base | Representation |
---|---|
bin | 100100101110000… |
… | …1000101001100110 |
3 | 10011212102210020022 |
4 | 1021130020221212 |
5 | 10010410042410 |
6 | 322132235142 |
7 | 42350531636 |
oct | 11134105146 |
9 | 3155383208 |
10 | 1232112230 |
11 | 58254a178 |
12 | 2a476bab2 |
13 | 1683589bb |
14 | b98cc6c6 |
15 | 73280455 |
hex | 49708a66 |
1232112230 has 16 divisors (see below), whose sum is σ = 2348261280. Its totient is φ = 463853952.
The previous prime is 1232112187. The next prime is 1232112251. The reversal of 1232112230 is 322112321.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 1232112199 and 1232112208.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3623690 + ... + 3624029.
It is an arithmetic number, because the mean of its divisors is an integer number (146766330).
Almost surely, 21232112230 is an apocalyptic number.
1232112230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1232112230 is a deficient number, since it is larger than the sum of its proper divisors (1116149050).
1232112230 is a wasteful number, since it uses less digits than its factorization.
1232112230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7247743.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1232112230 is about 35101.4562375979. The cubic root of 1232112230 is about 1072.0542334215.
Adding to 1232112230 its reverse (322112321), we get a palindrome (1554224551).
Subtracting from 1232112230 its reverse (322112321), we obtain a palindrome (909999909).
The spelling of 1232112230 in words is "one billion, two hundred thirty-two million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •