Base | Representation |
---|---|
bin | 10100011111011101… |
… | …01101001010100011 |
3 | 1001101200220222001222 |
4 | 22033232231022203 |
5 | 140012314220344 |
6 | 5015352245255 |
7 | 536423451350 |
oct | 121756551243 |
9 | 31350828058 |
10 | 11001320099 |
11 | 4735a5a690 |
12 | 21703a082b |
13 | 106429a483 |
14 | 765135627 |
15 | 445c505ee |
hex | 28fbad2a3 |
11001320099 has 16 divisors (see below), whose sum is σ = 13849105920. Its totient is φ = 8489223360.
The previous prime is 11001320063. The next prime is 11001320107. The reversal of 11001320099 is 99002310011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001320099 is a prime.
It is a super-2 number, since 2×110013200992 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11001320059) by changing a digit.
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, 685634 + ... + 701495.
It is an arithmetic number, because the mean of its divisors is an integer number (865569120).
Almost surely, 211001320099 is an apocalyptic number.
11001320099 is a deficient number, since it is larger than the sum of its proper divisors (2847785821).
11001320099 is a wasteful number, since it uses less digits than its factorization.
11001320099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1387250.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 11001320099 in words is "eleven billion, one million, three hundred twenty thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •