Base | Representation |
---|---|
bin | 1001100101110011010000… |
… | …1011001010111010101011 |
3 | 1101100002112120121201201011 |
4 | 2121130310023022322223 |
5 | 2340232200113231321 |
6 | 34232152040204351 |
7 | 2135565266361145 |
oct | 231346413127253 |
9 | 41302476551634 |
10 | 10545020055211 |
11 | 33a6132a05314 |
12 | 1223841a696b7 |
13 | 5b65113b9a05 |
14 | 28654b521c95 |
15 | 134478126ae1 |
hex | 997342caeab |
10545020055211 has 4 divisors (see below), whose sum is σ = 10702408414312. Its totient is φ = 10387631696112.
The previous prime is 10545020055191. The next prime is 10545020055313. The reversal of 10545020055211 is 11255002054501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10545020055211 - 27 = 10545020055083 is a prime.
It is a super-2 number, since 2×105450200552112 (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 (10545020035211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78694179450 + ... + 78694179583.
It is an arithmetic number, because the mean of its divisors is an integer number (2675602103578).
Almost surely, 210545020055211 is an apocalyptic number.
10545020055211 is a deficient number, since it is larger than the sum of its proper divisors (157388359101).
10545020055211 is an equidigital number, since it uses as much as digits as its factorization.
10545020055211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157388359100.
The product of its (nonzero) digits is 10000, while the sum is 31.
The spelling of 10545020055211 in words is "ten trillion, five hundred forty-five billion, twenty million, fifty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •