Base | Representation |
---|---|
bin | 10000011100100111001… |
… | …001001010011010010010 |
3 | 11000001022212222222221102 |
4 | 100130213021022122102 |
5 | 122004204134042320 |
6 | 2223115534024402 |
7 | 144441141640556 |
oct | 20344711123222 |
9 | 4001285888842 |
10 | 1130233112210 |
11 | 3a6369143744 |
12 | 163068948102 |
13 | 8277154c097 |
14 | 3c9bc873866 |
15 | 1e5eecc5175 |
hex | 1072724a692 |
1130233112210 has 8 divisors (see below), whose sum is σ = 2034419601996. Its totient is φ = 452093244880.
The previous prime is 1130233112171. The next prime is 1130233112213. The reversal of 1130233112210 is 122113320311.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1060214130889 + 70018981321 = 1029667^2 + 264611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1130233112213) 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, 56511655601 + ... + 56511655620.
Almost surely, 21130233112210 is an apocalyptic number.
1130233112210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1130233112210 is a deficient number, since it is larger than the sum of its proper divisors (904186489786).
1130233112210 is a wasteful number, since it uses less digits than its factorization.
1130233112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113023311228.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1130233112210 its reverse (122113320311), we get a palindrome (1252346432521).
The spelling of 1130233112210 in words is "one trillion, one hundred thirty billion, two hundred thirty-three million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •