Base | Representation |
---|---|
bin | 10100100001101100… |
… | …10110101010011011 |
3 | 1001110000021012102000 |
4 | 22100312112222123 |
5 | 140032121233144 |
6 | 5021303012043 |
7 | 540042216063 |
oct | 122066265233 |
9 | 31400235360 |
10 | 11020102299 |
11 | 4745618a68 |
12 | 217673a023 |
13 | 10681454bb |
14 | 7678243a3 |
15 | 447710769 |
hex | 290d96a9b |
11020102299 has 8 divisors (see below), whose sum is σ = 16326077520. Its totient is φ = 7346734848.
The previous prime is 11020102271. The next prime is 11020102343. The reversal of 11020102299 is 99220102011.
11020102299 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11020102299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 408151937 = 11020102299 / (1 + 1 + 0 + 2 + 0 + 1 + 0 + 2 + 2 + 9 + 9).
It is not an unprimeable number, because it can be changed into a prime (11020102259) 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 7 ways as a sum of consecutive naturals, for example, 204075942 + ... + 204075995.
It is an arithmetic number, because the mean of its divisors is an integer number (2040759690).
Almost surely, 211020102299 is an apocalyptic number.
11020102299 is a deficient number, since it is larger than the sum of its proper divisors (5305975221).
11020102299 is an equidigital number, since it uses as much as digits as its factorization.
11020102299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408151946 (or 408151940 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 11020102299 in words is "eleven billion, twenty million, one hundred two thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •