Base | Representation |
---|---|
bin | 10111111000000001100100… |
… | …101111010000001000011011 |
3 | 111202210101101111221201222121 |
4 | 113320001210233100020123 |
5 | 102230400320420423201 |
6 | 1011154353154202111 |
7 | 31055236020024244 |
oct | 2770014457201033 |
9 | 452711344851877 |
10 | 105005050561051 |
11 | 30504434624a33 |
12 | b93a822b83337 |
13 | 4678c1a68c674 |
14 | 1bd03b325bccb |
15 | c216505d39a1 |
hex | 5f8064bd021b |
105005050561051 has 8 divisors (see below), whose sum is σ = 107322351578064. Its totient is φ = 102712801447200.
The previous prime is 105005050561013. The next prime is 105005050561057. The reversal of 105005050561051 is 150165050500501.
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 105005050561051 - 27 = 105005050560923 is a prime.
It is a super-2 number, since 2×1050050505610512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105005050560998 and 105005050561016.
It is not an unprimeable number, because it can be changed into a prime (105005050561057) 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, 6262967316 + ... + 6262984081.
It is an arithmetic number, because the mean of its divisors is an integer number (13415293947258).
Almost surely, 2105005050561051 is an apocalyptic number.
105005050561051 is a deficient number, since it is larger than the sum of its proper divisors (2317301017013).
105005050561051 is a wasteful number, since it uses less digits than its factorization.
105005050561051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12525951581.
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 105005050561051 in words is "one hundred five trillion, five billion, fifty million, five hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •