Base | Representation |
---|---|
bin | 10110111101111001000101… |
… | …110010000100101000010001 |
3 | 111020122111000022201001212111 |
4 | 112331321011302010220101 |
5 | 101214422403133341033 |
6 | 554455241155425321 |
7 | 30163514131222234 |
oct | 2675710562045021 |
9 | 436574008631774 |
10 | 101010211621393 |
11 | 2a204210147398 |
12 | b3b45575b5241 |
13 | 44492b6bc4ab9 |
14 | 1ad2cc554741b |
15 | ba27927967cd |
hex | 5bde45c84a11 |
101010211621393 has 2 divisors, whose sum is σ = 101010211621394. Its totient is φ = 101010211621392.
The previous prime is 101010211621369. The next prime is 101010211621427. The reversal of 101010211621393 is 393126112010101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76192508084224 + 24817703537169 = 8728832^2 + 4981737^2 .
It is an emirp because it is prime and its reverse (393126112010101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101010211621393 is a prime.
It is not a weakly prime, because it can be changed into another prime (101010211624393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505105810696 + 50505105810697.
It is an arithmetic number, because the mean of its divisors is an integer number (50505105810697).
Almost surely, 2101010211621393 is an apocalyptic number.
It is an amenable number.
101010211621393 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010211621393 is an equidigital number, since it uses as much as digits as its factorization.
101010211621393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 31.
Adding to 101010211621393 its reverse (393126112010101), we get a palindrome (494136323631494).
The spelling of 101010211621393 in words is "one hundred one trillion, ten billion, two hundred eleven million, six hundred twenty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •