Base | Representation |
---|---|
bin | 1001010010000010101010… |
… | …0010101111101001001011 |
3 | 1100010122022202012100011111 |
4 | 2110200222202233221023 |
5 | 2314201434321441121 |
6 | 33412211232311151 |
7 | 2102220123042325 |
oct | 224405242575113 |
9 | 40118282170144 |
10 | 10205556046411 |
11 | 328517436a110 |
12 | 1189aa40a24b7 |
13 | 5904c258290b |
14 | 273d47096615 |
15 | 12a70b0582e1 |
hex | 9482a8afa4b |
10205556046411 has 8 divisors (see below), whose sum is σ = 11186098486848. Its totient is φ = 9233807709000.
The previous prime is 10205556046379. The next prime is 10205556046417. The reversal of 10205556046411 is 11464065550201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10205556046411 - 25 = 10205556046379 is a prime.
It is a super-2 number, since 2×102055560464112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10205556046417) 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, 2198523325 + ... + 2198527966.
It is an arithmetic number, because the mean of its divisors is an integer number (1398262310856).
Almost surely, 210205556046411 is an apocalyptic number.
10205556046411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10205556046411 is a deficient number, since it is larger than the sum of its proper divisors (980542440437).
10205556046411 is a wasteful number, since it uses less digits than its factorization.
10205556046411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4397051513.
The product of its (nonzero) digits is 144000, while the sum is 40.
The spelling of 10205556046411 in words is "ten trillion, two hundred five billion, five hundred fifty-six million, forty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •