Base | Representation |
---|---|
bin | 11101000110110101111… |
… | …00001000111100101111 |
3 | 10112121110002011000121121 |
4 | 32203122330020330233 |
5 | 112341204014023210 |
6 | 2043235302041411 |
7 | 132153356300665 |
oct | 16433274107457 |
9 | 3477402130547 |
10 | 1000105611055 |
11 | 3561625aa061 |
12 | 1419b1419267 |
13 | 734041252a5 |
14 | 36596498c35 |
15 | 1b035b786da |
hex | e8daf08f2f |
1000105611055 has 16 divisors (see below), whose sum is σ = 1208360721600. Its totient is φ = 794596759552.
The previous prime is 1000105611047. The next prime is 1000105611067. The reversal of 1000105611055 is 5501165010001.
It is a cyclic number.
It is not a de Polignac number, because 1000105611055 - 23 = 1000105611047 is a prime.
It is a super-2 number, since 2×10001056110552 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5101662 + ... + 5294068.
It is an arithmetic number, because the mean of its divisors is an integer number (75522545100).
Almost surely, 21000105611055 is an apocalyptic number.
1000105611055 is a deficient number, since it is larger than the sum of its proper divisors (208255110545).
1000105611055 is a wasteful number, since it uses less digits than its factorization.
1000105611055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199538.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 1000105611055 in words is "one trillion, one hundred five million, six hundred eleven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •