Base | Representation |
---|---|
bin | 100100110000001001110… |
… | …1001100011101110010111 |
3 | 122212220001121000201001022 |
4 | 1021200103221203232113 |
5 | 1130224340031421211 |
6 | 14424254442151355 |
7 | 1030636502535323 |
oct | 111402351435627 |
9 | 18786047021038 |
10 | 5051211201431 |
11 | 167823004712a |
12 | 696b604b255b |
13 | 2a8433a4ab15 |
14 | 1366a0cc0983 |
15 | 8b5d85b5bdb |
hex | 49813a63b97 |
5051211201431 has 2 divisors, whose sum is σ = 5051211201432. Its totient is φ = 5051211201430.
The previous prime is 5051211201419. The next prime is 5051211201433. The reversal of 5051211201431 is 1341021121505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5051211201431 - 238 = 4776333294487 is a prime.
It is a super-2 number, since 2×50512112014312 (a number of 26 digits) contains 22 as substring.
Together with 5051211201433, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5051211201431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5051211201433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525605600715 + 2525605600716.
It is an arithmetic number, because the mean of its divisors is an integer number (2525605600716).
Almost surely, 25051211201431 is an apocalyptic number.
5051211201431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051211201431 is an equidigital number, since it uses as much as digits as its factorization.
5051211201431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 5051211201431 its reverse (1341021121505), we get a palindrome (6392232322936).
The spelling of 5051211201431 in words is "five trillion, fifty-one billion, two hundred eleven million, two hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •