Base | Representation |
---|---|
bin | 101111000101101111… |
… | …0010011011011001001 |
3 | 100200000112001212122001 |
4 | 1132023132103123021 |
5 | 3124100300142323 |
6 | 114242243031001 |
7 | 10206644504401 |
oct | 1361336233311 |
9 | 320015055561 |
10 | 101124224713 |
11 | 39982a96836 |
12 | 1772236b461 |
13 | 96c76c2775 |
14 | 4c744a7801 |
15 | 296cca83ad |
hex | 178b7936c9 |
101124224713 has 2 divisors, whose sum is σ = 101124224714. Its totient is φ = 101124224712.
The previous prime is 101124224711. The next prime is 101124224767. The reversal of 101124224713 is 317422421101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100795455289 + 328769424 = 317483^2 + 18132^2 .
It is a cyclic number.
It is not a de Polignac number, because 101124224713 - 21 = 101124224711 is a prime.
It is a super-4 number, since 4×1011242247134 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
Together with 101124224711, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101124224711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50562112356 + 50562112357.
It is an arithmetic number, because the mean of its divisors is an integer number (50562112357).
Almost surely, 2101124224713 is an apocalyptic number.
It is an amenable number.
101124224713 is a deficient number, since it is larger than the sum of its proper divisors (1).
101124224713 is an equidigital number, since it uses as much as digits as its factorization.
101124224713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 28.
Adding to 101124224713 its reverse (317422421101), we get a palindrome (418546645814).
The spelling of 101124224713 in words is "one hundred one billion, one hundred twenty-four million, two hundred twenty-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •