Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001100000001000111001 |
3 | 111020122120001021011220111012 |
4 | 112331321310301200020321 |
5 | 101214431012000013311 |
6 | 554455451321243305 |
7 | 30163542513310262 |
oct | 2675716461401071 |
9 | 436576037156435 |
10 | 101011000001081 |
11 | 2a204585170755 |
12 | b3b4737633535 |
13 | 44493b1339761 |
14 | 1ad2d5c129969 |
15 | ba27dbac578b |
hex | 5bde74c60239 |
101011000001081 has 2 divisors, whose sum is σ = 101011000001082. Its totient is φ = 101011000001080.
The previous prime is 101011000001069. The next prime is 101011000001123. The reversal of 101011000001081 is 180100000110101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100984089239056 + 26910762025 = 10049084^2 + 164045^2 .
It is a cyclic number.
It is not a de Polignac number, because 101011000001081 - 26 = 101011000001017 is a prime.
It is a super-2 number, since 2×1010110000010812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101011000001281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505500000540 + 50505500000541.
It is an arithmetic number, because the mean of its divisors is an integer number (50505500000541).
Almost surely, 2101011000001081 is an apocalyptic number.
It is an amenable number.
101011000001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011000001081 is an equidigital number, since it uses as much as digits as its factorization.
101011000001081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101011000001081 its reverse (180100000110101), we get a palindrome (281111000111182).
The spelling of 101011000001081 in words is "one hundred one trillion, eleven billion, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •