Base | Representation |
---|---|
bin | 10111111000000111001101… |
… | …010100001110001010000011 |
3 | 111202210222000010010121210202 |
4 | 113320013031110032022003 |
5 | 102231000213103100201 |
6 | 1011201233335515415 |
7 | 31055541644601356 |
oct | 2770071524161203 |
9 | 452728003117722 |
10 | 105011100050051 |
11 | 30506a59387618 |
12 | b93ba30b28b6b |
13 | 4679672a95060 |
14 | 1bd07c887029d |
15 | c218a6744c6b |
hex | 5f81cd50e283 |
105011100050051 has 8 divisors (see below), whose sum is σ = 116988493424880. Its totient is φ = 93590794739232.
The previous prime is 105011100050047. The next prime is 105011100050057. The reversal of 105011100050051 is 150050001110501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105011100050051 - 22 = 105011100050047 is a prime.
It is a super-2 number, since 2×1050111000500512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105011100050057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139272015605 + ... + 139272016358.
It is an arithmetic number, because the mean of its divisors is an integer number (14623561678110).
Almost surely, 2105011100050051 is an apocalyptic number.
105011100050051 is a deficient number, since it is larger than the sum of its proper divisors (11977393374829).
105011100050051 is a wasteful number, since it uses less digits than its factorization.
105011100050051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278544032005.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 105011100050051 its reverse (150050001110501), we get a palindrome (255061101160552).
The spelling of 105011100050051 in words is "one hundred five trillion, eleven billion, one hundred million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •