Base | Representation |
---|---|
bin | 1001001001010111100100… |
… | …0110000010011111110001 |
3 | 1022121101201021011021001020 |
4 | 2102111321012002133301 |
5 | 2304231303304104121 |
6 | 33215525413130053 |
7 | 2055363454103664 |
oct | 222257106023761 |
9 | 38541637137036 |
10 | 10056550066161 |
11 | 3227a6037a795 |
12 | 116503a329929 |
13 | 57c436c28631 |
14 | 26aa4d7376db |
15 | 1268d98781c6 |
hex | 925791827f1 |
10056550066161 has 16 divisors (see below), whose sum is σ = 13448856769920. Its totient is φ = 6684312741120.
The previous prime is 10056550066141. The next prime is 10056550066201. The reversal of 10056550066161 is 16166005565001.
It is not a de Polignac number, because 10056550066161 - 213 = 10056550057969 is a prime.
It is a super-2 number, since 2×100565500661612 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10056550066141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4274841 + ... + 6195753.
It is an arithmetic number, because the mean of its divisors is an integer number (840553548120).
Almost surely, 210056550066161 is an apocalyptic number.
It is an amenable number.
10056550066161 is a deficient number, since it is larger than the sum of its proper divisors (3392306703759).
10056550066161 is a wasteful number, since it uses less digits than its factorization.
10056550066161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1926136.
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 10056550066161 in words is "ten trillion, fifty-six billion, five hundred fifty million, sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •