Base | Representation |
---|---|
bin | 110001101010111011… |
… | …0011001000100111001 |
3 | 101012022210211002011122 |
4 | 1203111312121010321 |
5 | 3221423224124401 |
6 | 121000244235025 |
7 | 10464210500231 |
oct | 1432566310471 |
9 | 335283732148 |
10 | 106667020601 |
11 | 41267830389 |
12 | 1880a69ba75 |
13 | a09bb3b74b |
14 | 523c6a0cc1 |
15 | 2b946cd21b |
hex | 18d5d99139 |
106667020601 has 4 divisors (see below), whose sum is σ = 107663908752. Its totient is φ = 105670132452.
The previous prime is 106667020589. The next prime is 106667020651. The reversal of 106667020601 is 106020766601.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106667020601 is a prime.
It is a super-2 number, since 2×1066670206012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106667020651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 498443915 + ... + 498444128.
It is an arithmetic number, because the mean of its divisors is an integer number (26915977188).
Almost surely, 2106667020601 is an apocalyptic number.
It is an amenable number.
106667020601 is a deficient number, since it is larger than the sum of its proper divisors (996888151).
106667020601 is an equidigital number, since it uses as much as digits as its factorization.
106667020601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996888150.
The product of its (nonzero) digits is 18144, while the sum is 35.
The spelling of 106667020601 in words is "one hundred six billion, six hundred sixty-seven million, twenty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •