Base | Representation |
---|---|
bin | 1001100110101111001101… |
… | …0001010001011101111011 |
3 | 1101101122001222120200020100 |
4 | 2121223303101101131323 |
5 | 2341013123404130201 |
6 | 34243412445130443 |
7 | 2140005114241305 |
oct | 231536321213573 |
9 | 41348058520210 |
10 | 10561111005051 |
11 | 3401a3a920072 |
12 | 1226992859a23 |
13 | 5b7ba6c682c9 |
14 | 2872365aa975 |
15 | 134abaad5886 |
hex | 99af345177b |
10561111005051 has 12 divisors (see below), whose sum is σ = 15258313910320. Its totient is φ = 7039182612240.
The previous prime is 10561111005047. The next prime is 10561111005077. The reversal of 10561111005051 is 15050011116501.
10561111005051 is a `hidden beast` number, since 1 + 0 + 56 + 1 + 1 + 1 + 100 + 505 + 1 = 666.
It is not a de Polignac number, because 10561111005051 - 22 = 10561111005047 is a prime.
It is a super-2 number, since 2×105611110050512 (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 (10561111005041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 129795220 + ... + 129876561.
Almost surely, 210561111005051 is an apocalyptic number.
10561111005051 is a deficient number, since it is larger than the sum of its proper divisors (4697202905269).
10561111005051 is a wasteful number, since it uses less digits than its factorization.
10561111005051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259676306 (or 259676303 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
The spelling of 10561111005051 in words is "ten trillion, five hundred sixty-one billion, one hundred eleven million, five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •