Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001100010010101110101 |
3 | 111020122120001021012100212021 |
4 | 112331321310301202111311 |
5 | 101214431012000310401 |
6 | 554455451321353141 |
7 | 30163542513345466 |
oct | 2675716461422565 |
9 | 436576037170767 |
10 | 101011000010101 |
11 | 2a204585177505 |
12 | b3b47376387b1 |
13 | 44493b13408ac |
14 | 1ad2d5c12cd6d |
15 | ba27dbac82a1 |
hex | 5bde74c62575 |
101011000010101 has 2 divisors, whose sum is σ = 101011000010102. Its totient is φ = 101011000010100.
The previous prime is 101011000009973. The next prime is 101011000010131. The reversal of 101011000010101 is 101010000110101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90743628143025 + 10267371867076 = 9525945^2 + 3204274^2 .
It is an emirp because it is prime and its reverse (101010000110101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101011000010101 - 27 = 101011000009973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011000010131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505500005050 + 50505500005051.
It is an arithmetic number, because the mean of its divisors is an integer number (50505500005051).
Almost surely, 2101011000010101 is an apocalyptic number.
It is an amenable number.
101011000010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011000010101 is an equidigital number, since it uses as much as digits as its factorization.
101011000010101 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 7.
Adding to 101011000010101 its reverse (101010000110101), we get a palindrome (202021000120202).
The spelling of 101011000010101 in words is "one hundred one trillion, eleven billion, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •