Base | Representation |
---|---|
bin | 1010001101010000111100… |
… | …0110111110101010100110 |
3 | 1110201220112101012110211111 |
4 | 2203110033012332222212 |
5 | 2432334202234012410 |
6 | 35511435412255234 |
7 | 2235556322526253 |
oct | 243241706765246 |
9 | 43656471173744 |
10 | 11223003032230 |
11 | 36377156a0750 |
12 | 131311501151a |
13 | 63542b3245b2 |
14 | 2ab2a66d442a |
15 | 146e0933bb8a |
hex | a350f1beaa6 |
11223003032230 has 32 divisors (see below), whose sum is σ = 22046026514688. Its totient is φ = 4079586520800.
The previous prime is 11223003032221. The next prime is 11223003032281. The reversal of 11223003032230 is 3223030032211.
It is a super-2 number, since 2×112230030322302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18519072 + ... + 19115491.
It is an arithmetic number, because the mean of its divisors is an integer number (688938328584).
Almost surely, 211223003032230 is an apocalyptic number.
11223003032230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11223003032230 is a deficient number, since it is larger than the sum of its proper divisors (10823023482458).
11223003032230 is a wasteful number, since it uses less digits than its factorization.
11223003032230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37637292.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 11223003032230 its reverse (3223030032211), we get a palindrome (14446033064441).
The spelling of 11223003032230 in words is "eleven trillion, two hundred twenty-three billion, three million, thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •