Base | Representation |
---|---|
bin | 101111000110111001… |
… | …0011110100110100101 |
3 | 100200010020011022100101 |
4 | 1132031302132212211 |
5 | 3124140221132223 |
6 | 114250151344101 |
7 | 10210625613523 |
oct | 1361562364645 |
9 | 320106138311 |
10 | 101163067813 |
11 | 399a2a07175 |
12 | 17733382031 |
13 | 9702772852 |
14 | 4c796d9313 |
15 | 29713cc4ad |
hex | 178dc9e9a5 |
101163067813 has 2 divisors, whose sum is σ = 101163067814. Its totient is φ = 101163067812.
The previous prime is 101163067771. The next prime is 101163067843. The reversal of 101163067813 is 318760361101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98393887684 + 2769180129 = 313678^2 + 52623^2 .
It is a cyclic number.
It is not a de Polignac number, because 101163067813 - 29 = 101163067301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101163067843) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50581533906 + 50581533907.
It is an arithmetic number, because the mean of its divisors is an integer number (50581533907).
Almost surely, 2101163067813 is an apocalyptic number.
It is an amenable number.
101163067813 is a deficient number, since it is larger than the sum of its proper divisors (1).
101163067813 is an equidigital number, since it uses as much as digits as its factorization.
101163067813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 37.
The spelling of 101163067813 in words is "one hundred one billion, one hundred sixty-three million, sixty-seven thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •