Base | Representation |
---|---|
bin | 10100100000100001… |
… | …00101001000100110 |
3 | 1001102022122010010222 |
4 | 22100100211020212 |
5 | 140022102400402 |
6 | 5020310444342 |
7 | 536562104516 |
oct | 122020451046 |
9 | 31368563128 |
10 | 11010200102 |
11 | 473aa75330 |
12 | 21733636b2 |
13 | 1066089305 |
14 | 7663a7846 |
15 | 4469067a2 |
hex | 290425226 |
11010200102 has 8 divisors (see below), whose sum is σ = 18016691112. Its totient is φ = 5004636400.
The previous prime is 11010200101. The next prime is 11010200153. The reversal of 11010200102 is 20100201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11010200102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010200101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250231799 + ... + 250231842.
It is an arithmetic number, because the mean of its divisors is an integer number (2252086389).
Almost surely, 211010200102 is an apocalyptic number.
11010200102 is a deficient number, since it is larger than the sum of its proper divisors (7006491010).
11010200102 is a wasteful number, since it uses less digits than its factorization.
11010200102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500463654.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11010200102 its reverse (20100201011), we get a palindrome (31110401113).
Subtracting 11010200102 from its reverse (20100201011), we obtain a palindrome (9090000909).
It can be divided in two parts, 11010 and 200102, that added together give a palindrome (211112).
The spelling of 11010200102 in words is "eleven billion, ten million, two hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •