Base | Representation |
---|---|
bin | 10100111110110101… |
… | …00111100011000110 |
3 | 1002002001010100212010 |
4 | 22133122213203012 |
5 | 141032202132140 |
6 | 5101433035050 |
7 | 546100403520 |
oct | 123732474306 |
9 | 32061110763 |
10 | 11264489670 |
11 | 48605688a5 |
12 | 2224555a86 |
13 | 10a6971305 |
14 | 78c07ca10 |
15 | 45ddd6880 |
hex | 29f6a78c6 |
11264489670 has 32 divisors (see below), whose sum is σ = 30896886528. Its totient is φ = 2574740448.
The previous prime is 11264489659. The next prime is 11264489689. The reversal of 11264489670 is 7698446211.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 26820004 + ... + 26820423.
It is an arithmetic number, because the mean of its divisors is an integer number (965527704).
Almost surely, 211264489670 is an apocalyptic number.
11264489670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11264489670 is an abundant number, since it is smaller than the sum of its proper divisors (19632396858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11264489670 is a wasteful number, since it uses less digits than its factorization.
11264489670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53640444.
The product of its (nonzero) digits is 580608, while the sum is 48.
The spelling of 11264489670 in words is "eleven billion, two hundred sixty-four million, four hundred eighty-nine thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •