Base | Representation |
---|---|
bin | 101111001011010111… |
… | …0100000000001011001 |
3 | 100200111200022200001211 |
4 | 1132112232200001121 |
5 | 3124442113114433 |
6 | 114313105343121 |
7 | 10214426314063 |
oct | 1362656400131 |
9 | 320450280054 |
10 | 101313019993 |
11 | 39a6a616499 |
12 | 17775637aa1 |
13 | 9727855a53 |
14 | 4c915b0733 |
15 | 297e64c8cd |
hex | 1796ba0059 |
101313019993 has 2 divisors, whose sum is σ = 101313019994. Its totient is φ = 101313019992.
The previous prime is 101313019991. The next prime is 101313020063. The reversal of 101313019993 is 399910313101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69670658304 + 31642361689 = 263952^2 + 177883^2 .
It is a cyclic number.
It is not a de Polignac number, because 101313019993 - 21 = 101313019991 is a prime.
Together with 101313019991, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101313019991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50656509996 + 50656509997.
It is an arithmetic number, because the mean of its divisors is an integer number (50656509997).
Almost surely, 2101313019993 is an apocalyptic number.
It is an amenable number.
101313019993 is a deficient number, since it is larger than the sum of its proper divisors (1).
101313019993 is an equidigital number, since it uses as much as digits as its factorization.
101313019993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19683, while the sum is 40.
The spelling of 101313019993 in words is "one hundred one billion, three hundred thirteen million, nineteen thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •