Base | Representation |
---|---|
bin | 1101001100000100010… |
… | …01101011001011101011 |
3 | 1121022200011100021110222 |
4 | 12212002021223023223 |
5 | 24411030203442311 |
6 | 544102051200255 |
7 | 44511415065425 |
oct | 6460211531353 |
9 | 1538604307428 |
10 | 453155140331 |
11 | 165200299043 |
12 | 739a88a608b |
13 | 33969c710ba |
14 | 17d0b961815 |
15 | bbc3279adb |
hex | 698226b2eb |
453155140331 has 2 divisors, whose sum is σ = 453155140332. Its totient is φ = 453155140330.
The previous prime is 453155140301. The next prime is 453155140349. The reversal of 453155140331 is 133041551354.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 453155140331 - 26 = 453155140267 is a prime.
It is a super-2 number, since 2×4531551403312 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 453155140291 and 453155140300.
It is not a weakly prime, because it can be changed into another prime (453155140301) 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, 226577570165 + 226577570166.
It is an arithmetic number, because the mean of its divisors is an integer number (226577570166).
Almost surely, 2453155140331 is an apocalyptic number.
453155140331 is a deficient number, since it is larger than the sum of its proper divisors (1).
453155140331 is an equidigital number, since it uses as much as digits as its factorization.
453155140331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 453155140331 its reverse (133041551354), we get a palindrome (586196691685).
The spelling of 453155140331 in words is "four hundred fifty-three billion, one hundred fifty-five million, one hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •