Base | Representation |
---|---|
bin | 10111111111010100101011… |
… | …110001011110001000011001 |
3 | 111211120022222210000200220200 |
4 | 113333110223301132020121 |
5 | 102312110012114440001 |
6 | 1012221022104212413 |
7 | 31136413024033032 |
oct | 2777245361361031 |
9 | 454508883020820 |
10 | 105506606015001 |
11 | 306881115a8a64 |
12 | b9bba78a6a109 |
13 | 46b42cbb47399 |
14 | 1c0a792c9ba89 |
15 | c2e707a67086 |
hex | 5ff52bc5e219 |
105506606015001 has 6 divisors (see below), whose sum is σ = 152398430910570. Its totient is φ = 70337737343328.
The previous prime is 105506606014961. The next prime is 105506606015039. The reversal of 105506606015001 is 100510606605501.
It can be written as a sum of positive squares in only one way, i.e., 58143980048400 + 47362625966601 = 7625220^2 + 6882051^2 .
It is not a de Polignac number, because 105506606015001 - 223 = 105506597626393 is a prime.
It is a super-2 number, since 2×1055066060150012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105506606015051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5861478111936 + ... + 5861478111953.
It is an arithmetic number, because the mean of its divisors is an integer number (25399738485095).
Almost surely, 2105506606015001 is an apocalyptic number.
It is an amenable number.
105506606015001 is a deficient number, since it is larger than the sum of its proper divisors (46891824895569).
105506606015001 is a wasteful number, since it uses less digits than its factorization.
105506606015001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11722956223895 (or 11722956223892 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 105506606015001 in words is "one hundred five trillion, five hundred six billion, six hundred six million, fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •