Base | Representation |
---|---|
bin | 1001010010000001010101… |
… | …0100100100101111100011 |
3 | 1100010121101221020211022120 |
4 | 2110200111110210233203 |
5 | 2314200222200311321 |
6 | 33412112033235323 |
7 | 2102205240555033 |
oct | 224402524445743 |
9 | 40117357224276 |
10 | 10205200010211 |
11 | 32850013a1918 |
12 | 1189a04a02b43 |
13 | 5904668950cb |
14 | 273d11a978c3 |
15 | 12a6d9b7aec6 |
hex | 94815524be3 |
10205200010211 has 8 divisors (see below), whose sum is σ = 13607132149440. Its totient is φ = 6803367272232.
The previous prime is 10205200010129. The next prime is 10205200010237. The reversal of 10205200010211 is 11201000250201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10205200010211 - 218 = 10205199748067 is a prime.
It is a super-2 number, since 2×102052000102112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10205200010911) 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 7 ways as a sum of consecutive naturals, for example, 24610425 + ... + 25021658.
It is an arithmetic number, because the mean of its divisors is an integer number (1700891518680).
Almost surely, 210205200010211 is an apocalyptic number.
10205200010211 is a deficient number, since it is larger than the sum of its proper divisors (3401932139229).
10205200010211 is an equidigital number, since it uses as much as digits as its factorization.
10205200010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49700625.
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 10205200010211 its reverse (11201000250201), we get a palindrome (21406200260412).
The spelling of 10205200010211 in words is "ten trillion, two hundred five billion, two hundred million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •