Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …110100110001000010110101 |
3 | 111020122110111100012111110001 |
4 | 112331320321310301002311 |
5 | 101214422000304013023 |
6 | 554455205231431301 |
7 | 30163506144042202 |
oct | 2675707164610265 |
9 | 436573440174401 |
10 | 101010011001013 |
11 | 2a204117980324 |
12 | b3b4500385531 |
13 | 444928448130a |
14 | 1ad2ca6a42ca9 |
15 | ba277ed686ad |
hex | 5bde39d310b5 |
101010011001013 has 2 divisors, whose sum is σ = 101010011001014. Its totient is φ = 101010011001012.
The previous prime is 101010011000981. The next prime is 101010011001079. The reversal of 101010011001013 is 310100110010101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52754175924849 + 48255835076164 = 7263207^2 + 6946642^2 .
It is an emirp because it is prime and its reverse (310100110010101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101010011001013 - 25 = 101010011000981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101010011001413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505005500506 + 50505005500507.
It is an arithmetic number, because the mean of its divisors is an integer number (50505005500507).
Almost surely, 2101010011001013 is an apocalyptic number.
It is an amenable number.
101010011001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010011001013 is an equidigital number, since it uses as much as digits as its factorization.
101010011001013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 101010011001013 its reverse (310100110010101), we get a palindrome (411110121011114).
The spelling of 101010011001013 in words is "one hundred one trillion, ten billion, eleven million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •