Base | Representation |
---|---|
bin | 110001100111101000… |
… | …1001100010001000111 |
3 | 101012001010001102010212 |
4 | 1203033101030101013 |
5 | 3221211442334021 |
6 | 120541301510035 |
7 | 10461400126316 |
oct | 1431721142107 |
9 | 335033042125 |
10 | 106556605511 |
11 | 41210475944 |
12 | 1879971231b |
13 | a081cbc485 |
14 | 522bb5c27d |
15 | 2b89b6c85b |
hex | 18cf44c447 |
106556605511 has 4 divisors (see below), whose sum is σ = 106558447800. Its totient is φ = 106554763224.
The previous prime is 106556605483. The next prime is 106556605537. The reversal of 106556605511 is 115506655601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106556605511 - 226 = 106489496647 is a prime.
It is a super-2 number, since 2×1065566055112 (a number of 23 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 (106556602511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 831476 + ... + 951033.
It is an arithmetic number, because the mean of its divisors is an integer number (26639611950).
Almost surely, 2106556605511 is an apocalyptic number.
106556605511 is a deficient number, since it is larger than the sum of its proper divisors (1842289).
106556605511 is an equidigital number, since it uses as much as digits as its factorization.
106556605511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1842288.
The product of its (nonzero) digits is 135000, while the sum is 41.
It can be divided in two parts, 10655 and 6605511, that added together give a palindrome (6616166).
The spelling of 106556605511 in words is "one hundred six billion, five hundred fifty-six million, six hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •