Base | Representation |
---|---|
bin | 110001101010001000… |
… | …0110111001000100111 |
3 | 101012020221201212110210 |
4 | 1203110100313020213 |
5 | 3221344420430111 |
6 | 120553453550503 |
7 | 10463435325636 |
oct | 1432420671047 |
9 | 335227655423 |
10 | 106640405031 |
11 | 41253801746 |
12 | 188017a5433 |
13 | a0964800a4 |
14 | 5238d3351d |
15 | 2b921c20a6 |
hex | 18d4437227 |
106640405031 has 8 divisors (see below), whose sum is σ = 143900305920. Its totient is φ = 70237053752.
The previous prime is 106640404991. The next prime is 106640405059. The reversal of 106640405031 is 130504046601.
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 106640405031 - 215 = 106640372263 is a prime.
It is a super-2 number, since 2×1066404050312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106640405031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106640405071) 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 7 ways as a sum of consecutive naturals, for example, 214137111 + ... + 214137608.
It is an arithmetic number, because the mean of its divisors is an integer number (17987538240).
Almost surely, 2106640405031 is an apocalyptic number.
106640405031 is a deficient number, since it is larger than the sum of its proper divisors (37259900889).
106640405031 is an equidigital number, since it uses as much as digits as its factorization.
106640405031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428274805.
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 106640405031 in words is "one hundred six billion, six hundred forty million, four hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •