Base | Representation |
---|---|
bin | 10111111000110001000001… |
… | …111011000010010011000111 |
3 | 111202222020220200201001001100 |
4 | 113320301001323002103013 |
5 | 102232214200022230421 |
6 | 1011234021331231143 |
7 | 31062021523415046 |
oct | 2770610173022307 |
9 | 452866820631040 |
10 | 105056006055111 |
11 | 305240026828a1 |
12 | b948683a484b3 |
13 | 468097b385a97 |
14 | 1bd2a4883255d |
15 | c22b33cb7c26 |
hex | 5f8c41ec24c7 |
105056006055111 has 24 divisors (see below), whose sum is σ = 155865963649760. Its totient is φ = 68136953391936.
The previous prime is 105056006055097. The next prime is 105056006055157. The reversal of 105056006055111 is 111550600650501.
It is a happy number.
105056006055111 is a `hidden beast` number, since 1 + 0 + 50 + 56 + 0 + 0 + 6 + 0 + 551 + 1 + 1 = 666.
It is not a de Polignac number, because 105056006055111 - 214 = 105056006038727 is a prime.
It is a super-2 number, since 2×1050560060551112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105056006055181) 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 23 ways as a sum of consecutive naturals, for example, 14283835 + ... + 20350428.
Almost surely, 2105056006055111 is an apocalyptic number.
105056006055111 is a deficient number, since it is larger than the sum of its proper divisors (50809957594649).
105056006055111 is a wasteful number, since it uses less digits than its factorization.
105056006055111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34643415 (or 34643412 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 105056006055111 in words is "one hundred five trillion, fifty-six billion, six million, fifty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •