Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …110010011011111110010001 |
3 | 111020222011101012220010021021 |
4 | 112333031221302123332101 |
5 | 101222414332030310001 |
6 | 555005055100155441 |
7 | 30203210163621331 |
oct | 2677155162337621 |
9 | 436864335803237 |
10 | 101101010010001 |
11 | 2a2397744a8681 |
12 | b40a077838b81 |
13 | 4454a27254671 |
14 | 1ad745a4b10c1 |
15 | ba4d08c7cba1 |
hex | 5bf369c9bf91 |
101101010010001 has 2 divisors, whose sum is σ = 101101010010002. Its totient is φ = 101101010010000.
The previous prime is 101101010009953. The next prime is 101101010010017. The reversal of 101101010010001 is 100010010101101.
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., 57135835380625 + 43965174629376 = 7558825^2 + 6630624^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101010010001 - 211 = 101101010007953 is a prime.
It is not a weakly prime, because it can be changed into another prime (101101010010601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550505005000 + 50550505005001.
It is an arithmetic number, because the mean of its divisors is an integer number (50550505005001).
Almost surely, 2101101010010001 is an apocalyptic number.
It is an amenable number.
101101010010001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101010010001 is an equidigital number, since it uses as much as digits as its factorization.
101101010010001 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 101101010010001 its reverse (100010010101101), we get a palindrome (201111020111102).
The spelling of 101101010010001 in words is "one hundred one trillion, one hundred one billion, ten million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •