Base | Representation |
---|---|
bin | 101111000101101011… |
… | …0011000000111101001 |
3 | 100200000101011022021001 |
4 | 1132023112120013221 |
5 | 3124044232144133 |
6 | 114242130315001 |
7 | 10206621031333 |
oct | 1361326300751 |
9 | 320011138231 |
10 | 101122146793 |
11 | 399818a7648 |
12 | 17721728a61 |
13 | 96c7145a25 |
14 | 4c740c6453 |
15 | 296c9e787d |
hex | 178b5981e9 |
101122146793 has 2 divisors, whose sum is σ = 101122146794. Its totient is φ = 101122146792.
The previous prime is 101122146787. The next prime is 101122146821. The reversal of 101122146793 is 397641221101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95584852224 + 5537294569 = 309168^2 + 74413^2 .
It is an emirp because it is prime and its reverse (397641221101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101122146793 - 25 = 101122146761 is a prime.
It is not a weakly prime, because it can be changed into another prime (101122146703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50561073396 + 50561073397.
It is an arithmetic number, because the mean of its divisors is an integer number (50561073397).
Almost surely, 2101122146793 is an apocalyptic number.
It is an amenable number.
101122146793 is a deficient number, since it is larger than the sum of its proper divisors (1).
101122146793 is an equidigital number, since it uses as much as digits as its factorization.
101122146793 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.
Adding to 101122146793 its reverse (397641221101), we get a palindrome (498763367894).
The spelling of 101122146793 in words is "one hundred one billion, one hundred twenty-two million, one hundred forty-six thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •