Base | Representation |
---|---|
bin | 10110111111001100110011… |
… | …100011011100110000100001 |
3 | 111020222002000210202111000211 |
4 | 112333030303203130300201 |
5 | 101222411001112031033 |
6 | 555004424514014121 |
7 | 30203145504614605 |
oct | 2677146343346041 |
9 | 436862023674024 |
10 | 101100100111393 |
11 | 2a239347925359 |
12 | b409a62b77341 |
13 | 44549108a3616 |
14 | 1ad73b16d9505 |
15 | ba4ca3e482cd |
hex | 5bf3338dcc21 |
101100100111393 has 2 divisors, whose sum is σ = 101100100111394. Its totient is φ = 101100100111392.
The previous prime is 101100100111331. The next prime is 101100100111529. The reversal of 101100100111393 is 393111001001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60470095167504 + 40630004943889 = 7776252^2 + 6374167^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100100111393 - 29 = 101100100110881 is a prime.
It is not a weakly prime, because it can be changed into another prime (101100100111693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550050055696 + 50550050055697.
It is an arithmetic number, because the mean of its divisors is an integer number (50550050055697).
Almost surely, 2101100100111393 is an apocalyptic number.
It is an amenable number.
101100100111393 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100100111393 is an equidigital number, since it uses as much as digits as its factorization.
101100100111393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 22.
Adding to 101100100111393 its reverse (393111001001101), we get a palindrome (494211101112494).
The spelling of 101100100111393 in words is "one hundred one trillion, one hundred billion, one hundred million, one hundred eleven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •