Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …010101000111010110000001 |
3 | 111020122120022221011102122021 |
4 | 112331321323111013112001 |
5 | 101214431223130000001 |
6 | 554455510251041441 |
7 | 30163545320265655 |
oct | 2675717325072601 |
9 | 436576287142567 |
10 | 101011110000001 |
11 | 2a204631271553 |
12 | b3b4768440281 |
13 | 44493cb071486 |
14 | 1ad2d6c9a0a65 |
15 | ba27e65a2ba1 |
hex | 5bde7b547581 |
101011110000001 has 4 divisors (see below), whose sum is σ = 101011177240000. Its totient is φ = 101011042760004.
The previous prime is 101011109999981. The next prime is 101011110000007. The reversal of 101011110000001 is 100000011110101.
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 101011110000001 - 29 = 101011109999489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011110000007) 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, 31313901 + ... + 34388698.
It is an arithmetic number, because the mean of its divisors is an integer number (25252794310000).
Almost surely, 2101011110000001 is an apocalyptic number.
It is an amenable number.
101011110000001 is a deficient number, since it is larger than the sum of its proper divisors (67239999).
101011110000001 is an equidigital number, since it uses as much as digits as its factorization.
101011110000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67239998.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101011110000001 its reverse (100000011110101), we get a palindrome (201011121110102).
The spelling of 101011110000001 in words is "one hundred one trillion, eleven billion, one hundred ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •