Base | Representation |
---|---|
bin | 11000001000110110101010… |
… | …011101110110000010110111 |
3 | 111220212221120002221000220121 |
4 | 120020312222131312002313 |
5 | 102403322342022333440 |
6 | 1013441541142512411 |
7 | 31234630405142542 |
oct | 3010665235660267 |
9 | 456787502830817 |
10 | 106161566605495 |
11 | 3090a95a7a4675 |
12 | baa69a5a35707 |
13 | 4730cba18534b |
14 | 1c303665d5859 |
15 | c4178c9e934a |
hex | 608daa7760b7 |
106161566605495 has 8 divisors (see below), whose sum is σ = 127396685428416. Its totient is φ = 84927382949856.
The previous prime is 106161566605433. The next prime is 106161566605499. The reversal of 106161566605495 is 594506665161601.
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 106161566605495 - 211 = 106161566603447 is a prime.
It is a super-2 number, since 2×1061615666054952 (a number of 29 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 (106161566605499) 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, 233542047 + ... + 233996176.
It is an arithmetic number, because the mean of its divisors is an integer number (15924585678552).
Almost surely, 2106161566605495 is an apocalyptic number.
106161566605495 is a deficient number, since it is larger than the sum of its proper divisors (21235118822921).
106161566605495 is an equidigital number, since it uses as much as digits as its factorization.
106161566605495 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467583641.
The product of its (nonzero) digits is 34992000, while the sum is 61.
The spelling of 106161566605495 in words is "one hundred six trillion, one hundred sixty-one billion, five hundred sixty-six million, six hundred five thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •