Base | Representation |
---|---|
bin | 10100111010101111… |
… | …10111110100000010 |
3 | 1001222122122001102200 |
4 | 22131113313310002 |
5 | 140444413343201 |
6 | 5054210254030 |
7 | 545203153563 |
oct | 123527676402 |
9 | 31878561380 |
10 | 11230215426 |
11 | 4843189081 |
12 | 2214b87316 |
13 | 109c8309b1 |
14 | 7876ba16a |
15 | 45adb6386 |
hex | 29d5f7d02 |
11230215426 has 24 divisors (see below), whose sum is σ = 24366480060. Its totient is φ = 3738121056.
The previous prime is 11230215397. The next prime is 11230215431. The reversal of 11230215426 is 62451203211.
11230215426 is a `hidden beast` number, since 1 + 1 + 23 + 0 + 215 + 426 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 11225614401 + 4601025 = 105951^2 + 2145^2 .
It is a super-2 number, since 2×112302154262 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11230215426.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 427225 + ... + 452748.
Almost surely, 211230215426 is an apocalyptic number.
11230215426 is an abundant number, since it is smaller than the sum of its proper divisors (13136264634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11230215426 is a wasteful number, since it uses less digits than its factorization.
11230215426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880690 (or 880687 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 11230215426 its reverse (62451203211), we get a palindrome (73681418637).
The spelling of 11230215426 in words is "eleven billion, two hundred thirty million, two hundred fifteen thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •