Base | Representation |
---|---|
bin | 101111000100000001… |
… | …1000001001111011101 |
3 | 100122212111220101101120 |
4 | 1132020003001033131 |
5 | 3123441041200301 |
6 | 114232431001153 |
7 | 10205346056463 |
oct | 1361003011735 |
9 | 318774811346 |
10 | 101066740701 |
11 | 399535a4193 |
12 | 177070691b9 |
13 | 96b8816a64 |
14 | 4c6a9c2833 |
15 | 2967c00e36 |
hex | 17880c13dd |
101066740701 has 4 divisors (see below), whose sum is σ = 134755654272. Its totient is φ = 67377827132.
The previous prime is 101066740693. The next prime is 101066740727. The reversal of 101066740701 is 107047660101.
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: 107047660101 = 3 ⋅35682553367.
It is a cyclic number.
It is not a de Polignac number, because 101066740701 - 23 = 101066740693 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101066740751) 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 3 ways as a sum of consecutive naturals, for example, 16844456781 + ... + 16844456786.
It is an arithmetic number, because the mean of its divisors is an integer number (33688913568).
Almost surely, 2101066740701 is an apocalyptic number.
It is an amenable number.
101066740701 is a deficient number, since it is larger than the sum of its proper divisors (33688913571).
101066740701 is an equidigital number, since it uses as much as digits as its factorization.
101066740701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33688913570.
The product of its (nonzero) digits is 7056, while the sum is 33.
The spelling of 101066740701 in words is "one hundred one billion, sixty-six million, seven hundred forty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •