Base | Representation |
---|---|
bin | 10100111010011000… |
… | …00101011111001001 |
3 | 1001222102211002010120 |
4 | 22131030011133021 |
5 | 140443121010310 |
6 | 5054020133453 |
7 | 545134664625 |
oct | 123514053711 |
9 | 31872732116 |
10 | 11227125705 |
11 | 4841468794 |
12 | 2213b37289 |
13 | 109bcbb563 |
14 | 787114185 |
15 | 45a9a5b70 |
hex | 29d3057c9 |
11227125705 has 32 divisors (see below), whose sum is σ = 18367948800. Its totient is φ = 5853262272.
The previous prime is 11227125691. The next prime is 11227125709. The reversal of 11227125705 is 50752172211.
11227125705 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11227125705 - 27 = 11227125577 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11227125709) 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 31 ways as a sum of consecutive naturals, for example, 596326 + ... + 614864.
It is an arithmetic number, because the mean of its divisors is an integer number (573998400).
Almost surely, 211227125705 is an apocalyptic number.
11227125705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11227125705 is a deficient number, since it is larger than the sum of its proper divisors (7140823095).
11227125705 is a wasteful number, since it uses less digits than its factorization.
11227125705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19453.
The product of its (nonzero) digits is 9800, while the sum is 33.
Adding to 11227125705 its reverse (50752172211), we get a palindrome (61979297916).
The spelling of 11227125705 in words is "eleven billion, two hundred twenty-seven million, one hundred twenty-five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •