Base | Representation |
---|---|
bin | 10100100001100101… |
… | …10000011010101101 |
3 | 1001102221111021201220 |
4 | 22100302300122231 |
5 | 140031401043323 |
6 | 5021230453553 |
7 | 540031210416 |
oct | 122062603255 |
9 | 31387437656 |
10 | 11019159213 |
11 | 4745034457 |
12 | 21763642b9 |
13 | 1067ba516a |
14 | 76765a80d |
15 | 4475c60e3 |
hex | 290cb06ad |
11019159213 has 8 divisors (see below), whose sum is σ = 14693616000. Its totient is φ = 7345404288.
The previous prime is 11019159199. The next prime is 11019159233. The reversal of 11019159213 is 31295191011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11019159213 - 24 = 11019159197 is a prime.
It is a super-2 number, since 2×110191592132 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11019159233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137668 + ... + 202461.
It is an arithmetic number, because the mean of its divisors is an integer number (1836702000).
Almost surely, 211019159213 is an apocalyptic number.
It is an amenable number.
11019159213 is a deficient number, since it is larger than the sum of its proper divisors (3674456787).
11019159213 is a wasteful number, since it uses less digits than its factorization.
11019159213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350931.
The product of its (nonzero) digits is 2430, while the sum is 33.
The spelling of 11019159213 in words is "eleven billion, nineteen million, one hundred fifty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •