Base | Representation |
---|---|
bin | 1011111011111011011101… |
… | …0110100011001011001011 |
3 | 1201110122212011000210022222 |
4 | 2332332313112203023023 |
5 | 3210011331003343201 |
6 | 43525101432004255 |
7 | 2523122640553001 |
oct | 276766726431313 |
9 | 51418764023288 |
10 | 13124201231051 |
11 | 41aaa404a1999 |
12 | 157b68453068b |
13 | 7427b738c901 |
14 | 335301304a71 |
15 | 17b5cd3b191b |
hex | befb75a32cb |
13124201231051 has 2 divisors, whose sum is σ = 13124201231052. Its totient is φ = 13124201231050.
The previous prime is 13124201230993. The next prime is 13124201231077. The reversal of 13124201231051 is 15013210242131.
It is an a-pointer prime, because the next prime (13124201231077) can be obtained adding 13124201231051 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13124201231051 - 214 = 13124201214667 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13124201231051.
It is not a weakly prime, because it can be changed into another prime (13124201231081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6562100615525 + 6562100615526.
It is an arithmetic number, because the mean of its divisors is an integer number (6562100615526).
Almost surely, 213124201231051 is an apocalyptic number.
13124201231051 is a deficient number, since it is larger than the sum of its proper divisors (1).
13124201231051 is an equidigital number, since it uses as much as digits as its factorization.
13124201231051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 13124201231051 its reverse (15013210242131), we get a palindrome (28137411473182).
The spelling of 13124201231051 in words is "thirteen trillion, one hundred twenty-four billion, two hundred one million, two hundred thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •