Base | Representation |
---|---|
bin | 110010000001011001… |
… | …1000000000110101001 |
3 | 101021021100202121200202 |
4 | 1210002303000012221 |
5 | 3224444300402401 |
6 | 121203143041545 |
7 | 10521665224544 |
oct | 1440263000651 |
9 | 337240677622 |
10 | 107421106601 |
11 | 41614461356 |
12 | 1899b1402b5 |
13 | a18c136c93 |
14 | 52b08b785b |
15 | 2bda9d606b |
hex | 1902cc01a9 |
107421106601 has 4 divisors (see below), whose sum is σ = 107530386432. Its totient is φ = 107311826772.
The previous prime is 107421106589. The next prime is 107421106603. The reversal of 107421106601 is 106601124701.
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: 106601124701 = 1367 ⋅77981803.
It is a cyclic number.
It is not a de Polignac number, because 107421106601 - 210 = 107421105577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107421106603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54638441 + ... + 54640406.
It is an arithmetic number, because the mean of its divisors is an integer number (26882596608).
Almost surely, 2107421106601 is an apocalyptic number.
It is an amenable number.
107421106601 is a deficient number, since it is larger than the sum of its proper divisors (109279831).
107421106601 is an equidigital number, since it uses as much as digits as its factorization.
107421106601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109279830.
The product of its (nonzero) digits is 2016, while the sum is 29.
The spelling of 107421106601 in words is "one hundred seven billion, four hundred twenty-one million, one hundred six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •