Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00010100000011011 |
3 | 1001101200100102121001 |
4 | 22033231202200123 |
5 | 140012224424144 |
6 | 5015341525431 |
7 | 536421035662 |
oct | 121755424033 |
9 | 31350312531 |
10 | 11001014299 |
11 | 4735870960 |
12 | 2170273877 |
13 | 10641c1222 |
14 | 765095dd9 |
15 | 445bdebd4 |
hex | 28fb6281b |
11001014299 has 16 divisors (see below), whose sum is σ = 12393621504. Its totient is φ = 9674107200.
The previous prime is 11001014293. The next prime is 11001014329. The reversal of 11001014299 is 99241010011.
11001014299 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11001014299 - 23 = 11001014291 is a prime.
It is a super-2 number, since 2×110010142992 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11001014291) 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 15 ways as a sum of consecutive naturals, for example, 984367 + ... + 995479.
It is an arithmetic number, because the mean of its divisors is an integer number (774601344).
Almost surely, 211001014299 is an apocalyptic number.
11001014299 is a deficient number, since it is larger than the sum of its proper divisors (1392607205).
11001014299 is a wasteful number, since it uses less digits than its factorization.
11001014299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14058.
The product of its (nonzero) digits is 648, while the sum is 28.
The spelling of 11001014299 in words is "eleven billion, one million, fourteen thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •