Base | Representation |
---|---|
bin | 10111111000110000100100… |
… | …010111001000111110011011 |
3 | 111202222012122010111012210011 |
4 | 113320300210113020332123 |
5 | 102232212141041343021 |
6 | 1011233500213302351 |
7 | 31062003322052233 |
oct | 2770604427107633 |
9 | 452865563435704 |
10 | 105055510106011 |
11 | 30523878732a03 |
12 | b9485659349b7 |
13 | 46808cc6bb78a |
14 | 1bd29dca12cc3 |
15 | c22b0549ede1 |
hex | 5f8c245c8f9b |
105055510106011 has 8 divisors (see below), whose sum is σ = 108721533120480. Its totient is φ = 101392381706112.
The previous prime is 105055510105991. The next prime is 105055510106017. The reversal of 105055510106011 is 110601015550501.
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 105055510106011 - 219 = 105055509581723 is a prime.
It is a super-2 number, since 2×1050555101060112 (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 (105055510106017) 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, 723579790 + ... + 723724963.
It is an arithmetic number, because the mean of its divisors is an integer number (13590191640060).
Almost surely, 2105055510106011 is an apocalyptic number.
105055510106011 is a deficient number, since it is larger than the sum of its proper divisors (3666023014469).
105055510106011 is a wasteful number, since it uses less digits than its factorization.
105055510106011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447307285.
The product of its (nonzero) digits is 3750, while the sum is 31.
Adding to 105055510106011 its reverse (110601015550501), we get a palindrome (215656525656512).
The spelling of 105055510106011 in words is "one hundred five trillion, fifty-five billion, five hundred ten million, one hundred six thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •