Base | Representation |
---|---|
bin | 1001110111110111111000… |
… | …1111100110110101001101 |
3 | 1102102202221111010021210010 |
4 | 2131331332033212311031 |
5 | 2410324031044034141 |
6 | 35030540435103433 |
7 | 2200166263515000 |
oct | 235757617466515 |
9 | 42382844107703 |
10 | 10855500377421 |
11 | 3505878a62827 |
12 | 1273a51141b79 |
13 | 60989158b2bb |
14 | 2975a24d9537 |
15 | 13c59a921416 |
hex | 9df7e3e6d4d |
10855500377421 has 64 divisors (see below), whose sum is σ = 16965605491200. Its totient is φ = 6171494837760.
The previous prime is 10855500377387. The next prime is 10855500377483. The reversal of 10855500377421 is 12477300555801.
It is not a de Polignac number, because 10855500377421 - 218 = 10855500115277 is a prime.
It is a super-2 number, since 2×108555003774212 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10855500377021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 188785551 + ... + 188843043.
It is an arithmetic number, because the mean of its divisors is an integer number (265087585800).
Almost surely, 210855500377421 is an apocalyptic number.
It is an amenable number.
10855500377421 is a deficient number, since it is larger than the sum of its proper divisors (6110105113779).
10855500377421 is an equidigital number, since it uses as much as digits as its factorization.
10855500377421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58451 (or 58437 counting only the distinct ones).
The product of its (nonzero) digits is 1176000, while the sum is 48.
The spelling of 10855500377421 in words is "ten trillion, eight hundred fifty-five billion, five hundred million, three hundred seventy-seven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •