Base | Representation |
---|---|
bin | 1010000010001101100101… |
… | …1000100100010100100110 |
3 | 1110001202102022122010020212 |
4 | 2200203121120210110212 |
5 | 2421231314004042410 |
6 | 35244314034455422 |
7 | 2216055035040542 |
oct | 240433130442446 |
9 | 43052368563225 |
10 | 11033123112230 |
11 | 357413740042a |
12 | 12a2362734572 |
13 | 62055a84704b |
14 | 2a20126b2a22 |
15 | 141ee4594b05 |
hex | a08d9624526 |
11033123112230 has 8 divisors (see below), whose sum is σ = 19859621602032. Its totient is φ = 4413249244888.
The previous prime is 11033123112227. The next prime is 11033123112247. The reversal of 11033123112230 is 3221132133011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11033123112196 and 11033123112205.
It is a congruent number.
It is an unprimeable number.
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, 551656155602 + ... + 551656155621.
It is an arithmetic number, because the mean of its divisors is an integer number (2482452700254).
Almost surely, 211033123112230 is an apocalyptic number.
11033123112230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11033123112230 is a deficient number, since it is larger than the sum of its proper divisors (8826498489802).
11033123112230 is a wasteful number, since it uses less digits than its factorization.
11033123112230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103312311230.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11033123112230 its reverse (3221132133011), we get a palindrome (14254255245241).
The spelling of 11033123112230 in words is "eleven trillion, thirty-three billion, one hundred twenty-three million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •