Base | Representation |
---|---|
bin | 111001000100110100101101… |
… | …001010110110001101111001 |
3 | 1012220210021210212020110010211 |
4 | 321010310231022312031321 |
5 | 230400203202041323303 |
6 | 2245513015105311121 |
7 | 103605414421121545 |
oct | 7104645512661571 |
9 | 1186707725213124 |
10 | 251020121432953 |
11 | 72a8a043516764 |
12 | 241a146a9354a1 |
13 | aa0b132861522 |
14 | 45db61db2aa25 |
15 | 1e04921bbb66d |
hex | e44d2d2b6379 |
251020121432953 has 2 divisors, whose sum is σ = 251020121432954. Its totient is φ = 251020121432952.
The previous prime is 251020121432797. The next prime is 251020121432981. The reversal of 251020121432953 is 359234121020152.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 207051724261264 + 43968397171689 = 14389292^2 + 6630867^2 .
It is a cyclic number.
It is not a de Polignac number, because 251020121432953 - 229 = 251019584562041 is a prime.
It is a super-2 number, since 2×2510201214329532 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (251020121435953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 125510060716476 + 125510060716477.
It is an arithmetic number, because the mean of its divisors is an integer number (125510060716477).
Almost surely, 2251020121432953 is an apocalyptic number.
It is an amenable number.
251020121432953 is a deficient number, since it is larger than the sum of its proper divisors (1).
251020121432953 is an equidigital number, since it uses as much as digits as its factorization.
251020121432953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 40.
The spelling of 251020121432953 in words is "two hundred fifty-one trillion, twenty billion, one hundred twenty-one million, four hundred thirty-two thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •