Base | Representation |
---|---|
bin | 110001011010001101… |
… | …1111100101110101101 |
3 | 101010212201222200000011 |
4 | 1202310123330232231 |
5 | 3214301222044441 |
6 | 120424501133221 |
7 | 10444262602246 |
oct | 1426433745655 |
9 | 333781880004 |
10 | 106106440621 |
11 | 40aaa357345 |
12 | 186929ba211 |
13 | a00c96570c |
14 | 51c8059ccd |
15 | 2b6039a581 |
hex | 18b46fcbad |
106106440621 has 4 divisors (see below), whose sum is σ = 108364024512. Its totient is φ = 103848856732.
The previous prime is 106106440619. The next prime is 106106440631. The reversal of 106106440621 is 126044601601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 126044601601 = 271 ⋅465109231.
It is a cyclic number.
It is not a de Polignac number, because 106106440621 - 21 = 106106440619 is a prime.
It is a super-2 number, since 2×1061064406212 (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 (106106440631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1128791875 + ... + 1128791968.
It is an arithmetic number, because the mean of its divisors is an integer number (27091006128).
Almost surely, 2106106440621 is an apocalyptic number.
It is an amenable number.
106106440621 is a deficient number, since it is larger than the sum of its proper divisors (2257583891).
106106440621 is an equidigital number, since it uses as much as digits as its factorization.
106106440621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2257583890.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 106106440621 in words is "one hundred six billion, one hundred six million, four hundred forty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •