Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …000011100001011000001001 |
3 | 111020122122220202122101001011 |
4 | 112331322313003201120021 |
5 | 101214440301134133001 |
6 | 554500153523523521 |
7 | 30163612205314666 |
oct | 2675726703413011 |
9 | 436578822571034 |
10 | 101012112021001 |
11 | 2a204aa5945785 |
12 | b3b49a7b295a1 |
13 | 444952a8384cc |
14 | 1ad3025ab6a6d |
15 | ba2854532d51 |
hex | 5bdeb70e1609 |
101012112021001 has 4 divisors (see below), whose sum is σ = 101012142559104. Its totient is φ = 101012081482900.
The previous prime is 101012112020921. The next prime is 101012112021019. The reversal of 101012112021001 is 100120211210101.
It is a happy number.
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 not a de Polignac number, because 101012112021001 - 29 = 101012112020489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101012112028001) 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, 9607765 + ... + 17156146.
It is an arithmetic number, because the mean of its divisors is an integer number (25253035639776).
Almost surely, 2101012112021001 is an apocalyptic number.
It is an amenable number.
101012112021001 is a deficient number, since it is larger than the sum of its proper divisors (30538103).
101012112021001 is an equidigital number, since it uses as much as digits as its factorization.
101012112021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30538102.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101012112021001 its reverse (100120211210101), we get a palindrome (201132323231102).
The spelling of 101012112021001 in words is "one hundred one trillion, twelve billion, one hundred twelve million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •