Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101100101110100011001001 |
3 | 111021000000120211012212102122 |
4 | 112333112001230232203021 |
5 | 101223041240240213001 |
6 | 555013143202341025 |
7 | 30203646040625534 |
oct | 2677260154564311 |
9 | 437000524185378 |
10 | 101110001101001 |
11 | 2a2425687643a2 |
12 | b40b96695a775 |
13 | 445582ac05859 |
14 | 1ad7a70647a1b |
15 | ba5183299b1b |
hex | 5bf581b2e8c9 |
101110001101001 has 2 divisors, whose sum is σ = 101110001101002. Its totient is φ = 101110001101000.
The previous prime is 101110001100991. The next prime is 101110001101051. The reversal of 101110001101001 is 100101100011101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54249117160000 + 46860883941001 = 7365400^2 + 6845501^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110001101001 - 230 = 101108927359177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101110001101001.
It is not a weakly prime, because it can be changed into another prime (101110001101051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555000550500 + 50555000550501.
It is an arithmetic number, because the mean of its divisors is an integer number (50555000550501).
Almost surely, 2101110001101001 is an apocalyptic number.
It is an amenable number.
101110001101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110001101001 is an equidigital number, since it uses as much as digits as its factorization.
101110001101001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101110001101001 its reverse (100101100011101), we get a palindrome (201211101112102).
The spelling of 101110001101001 in words is "one hundred one trillion, one hundred ten billion, one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •