Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110101101110110111110001 |
3 | 111020122120001100021020122022 |
4 | 112331321310311232313301 |
5 | 101214431012241010001 |
6 | 554455451401121225 |
7 | 30163542525606263 |
oct | 2675716465566761 |
9 | 436576040236568 |
10 | 101011001110001 |
11 | 2a204585858914 |
12 | b3b4737a89215 |
13 | 44493b1637418 |
14 | 1ad2d5c337b33 |
15 | ba27dbc4411b |
hex | 5bde74d6edf1 |
101011001110001 has 8 divisors (see below), whose sum is σ = 103161400408704. Its totient is φ = 98860653022320.
The previous prime is 101011001109947. The next prime is 101011001110003. The reversal of 101011001110001 is 100011100110101.
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 101011001110001 - 26 = 101011001109937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011001110003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8802710 + ... + 16718543.
It is an arithmetic number, because the mean of its divisors is an integer number (12895175051088).
Almost surely, 2101011001110001 is an apocalyptic number.
It is an amenable number.
101011001110001 is a deficient number, since it is larger than the sum of its proper divisors (2150399298703).
101011001110001 is an equidigital number, since it uses as much as digits as its factorization.
101011001110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25605511.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101011001110001 its reverse (100011100110101), we get a palindrome (201022101220102).
The spelling of 101011001110001 in words is "one hundred one trillion, eleven billion, one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •