Base | Representation |
---|---|
bin | 10100111010110001… |
… | …01101100010110001 |
3 | 1001222200001020022202 |
4 | 22131120231202301 |
5 | 140444442414010 |
6 | 5054215112545 |
7 | 545205061322 |
oct | 123530554261 |
9 | 31880036282 |
10 | 11230435505 |
11 | 4843319463 |
12 | 2215072755 |
13 | 109c8a9c13 |
14 | 787736449 |
15 | 45ae0b6a5 |
hex | 29d62d8b1 |
11230435505 has 32 divisors (see below), whose sum is σ = 13765883040. Its totient is φ = 8794275840.
The previous prime is 11230435499. The next prime is 11230435519. The reversal of 11230435505 is 50553403211.
11230435505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 16 ways, for example, as 11064515344 + 165920161 = 105188^2 + 12881^2 .
It is not a de Polignac number, because 11230435505 - 212 = 11230431409 is a prime.
It is a super-2 number, since 2×112304355052 (a number of 21 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 19736861 + ... + 19737429.
It is an arithmetic number, because the mean of its divisors is an integer number (430183845).
Almost surely, 211230435505 is an apocalyptic number.
It is an amenable number.
11230435505 is a deficient number, since it is larger than the sum of its proper divisors (2535447535).
11230435505 is a wasteful number, since it uses less digits than its factorization.
11230435505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1061.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 11230435505 its reverse (50553403211), we get a palindrome (61783838716).
The spelling of 11230435505 in words is "eleven billion, two hundred thirty million, four hundred thirty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •