Base | Representation |
---|---|
bin | 10110111101111001111010… |
… | …110110100110101101010001 |
3 | 111020122120022101010002110001 |
4 | 112331321322312212231101 |
5 | 101214431214103031001 |
6 | 554455505403410001 |
7 | 30163545162305122 |
oct | 2675717266465521 |
9 | 436576271102401 |
10 | 101011102002001 |
11 | 2a2046277a9534 |
12 | b3b4765823901 |
13 | 44493c9500c29 |
14 | 1ad2d6b8bc049 |
15 | ba27e5a23001 |
hex | 5bde7ada6b51 |
101011102002001 has 8 divisors (see below), whose sum is σ = 106342075343520. Its totient is φ = 95681588615712.
The previous prime is 101011102001981. The next prime is 101011102002049. The reversal of 101011102002001 is 100200201110101.
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 101011102002001 - 215 = 101011101969233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011102002101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 364846780 + ... + 365123533.
It is an arithmetic number, because the mean of its divisors is an integer number (13292759417940).
Almost surely, 2101011102002001 is an apocalyptic number.
It is an amenable number.
101011102002001 is a deficient number, since it is larger than the sum of its proper divisors (5330973341519).
101011102002001 is an equidigital number, since it uses as much as digits as its factorization.
101011102002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729977615.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101011102002001 its reverse (100200201110101), we get a palindrome (201211303112102).
The spelling of 101011102002001 in words is "one hundred one trillion, eleven billion, one hundred two million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •