Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001100000001100000001 |
3 | 111020122120001021011220202121 |
4 | 112331321310301200030001 |
5 | 101214431012000020111 |
6 | 554455451321244241 |
7 | 30163542513310666 |
oct | 2675716461401401 |
9 | 436576037156677 |
10 | 101011000001281 |
11 | 2a204585170917 |
12 | b3b4737633681 |
13 | 44493b1339886 |
14 | 1ad2d5c129a6d |
15 | ba27dbac5871 |
hex | 5bde74c60301 |
101011000001281 has 2 divisors, whose sum is σ = 101011000001282. Its totient is φ = 101011000001280.
The previous prime is 101011000001267. The next prime is 101011000001321. The reversal of 101011000001281 is 182100000110101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88903495188225 + 12107504813056 = 9428865^2 + 3479584^2 .
It is a cyclic number.
It is not a de Polignac number, because 101011000001281 - 211 = 101010999999233 is a prime.
It is a super-2 number, since 2×1010110000012812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101011000001081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505500000640 + 50505500000641.
It is an arithmetic number, because the mean of its divisors is an integer number (50505500000641).
Almost surely, 2101011000001281 is an apocalyptic number.
It is an amenable number.
101011000001281 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011000001281 is an equidigital number, since it uses as much as digits as its factorization.
101011000001281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101011000001281 its reverse (182100000110101), we get a palindrome (283111000111382).
The spelling of 101011000001281 in words is "one hundred one trillion, eleven billion, one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •