Base | Representation |
---|---|
bin | 1110101000100110010… |
… | …1001011000100011111 |
3 | 220000221122011200201202 |
4 | 3222021211023010133 |
5 | 13104400034421211 |
6 | 311255444230115 |
7 | 24110221341224 |
oct | 3521145130437 |
9 | 800848150652 |
10 | 251416326431 |
11 | 97696a64266 |
12 | 4088699b33b |
13 | 1a92963597a |
14 | c25097394b |
15 | 681733653b |
hex | 3a8994b11f |
251416326431 has 2 divisors, whose sum is σ = 251416326432. Its totient is φ = 251416326430.
The previous prime is 251416326401. The next prime is 251416326433. The reversal of 251416326431 is 134623614152.
251416326431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-251416326431 is a prime.
It is a super-2 number, since 2×2514163264312 (a number of 24 digits) contains 22 as substring.
Together with 251416326433, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (251416326433) 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, 125708163215 + 125708163216.
It is an arithmetic number, because the mean of its divisors is an integer number (125708163216).
Almost surely, 2251416326431 is an apocalyptic number.
251416326431 is a deficient number, since it is larger than the sum of its proper divisors (1).
251416326431 is an equidigital number, since it uses as much as digits as its factorization.
251416326431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 38.
The spelling of 251416326431 in words is "two hundred fifty-one billion, four hundred sixteen million, three hundred twenty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •