Base | Representation |
---|---|
bin | 110011011010111101011100… |
… | …1111011111111100010001011 |
3 | 2012022111001011120022112110012 |
4 | 1212311322321323333202023 |
5 | 433241040421104002301 |
6 | 4241550322052142135 |
7 | 164162016303316103 |
oct | 14665727173774213 |
9 | 2168431146275405 |
10 | 452306125453451 |
11 | 121133a50249695 |
12 | 4288bb5a30794b |
13 | 1654c3913b5959 |
14 | 7d99a3a18c203 |
15 | 37457c1093ebb |
hex | 19b5eb9eff88b |
452306125453451 has 2 divisors, whose sum is σ = 452306125453452. Its totient is φ = 452306125453450.
The previous prime is 452306125453433. The next prime is 452306125453453. The reversal of 452306125453451 is 154354521603254.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 452306125453451 - 210 = 452306125452427 is a prime.
It is a super-2 number, since 2×4523061254534512 (a number of 30 digits) contains 22 as substring.
Together with 452306125453453, 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 452306125453451.
It is not a weakly prime, because it can be changed into another prime (452306125453453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 226153062726725 + 226153062726726.
It is an arithmetic number, because the mean of its divisors is an integer number (226153062726726).
Almost surely, 2452306125453451 is an apocalyptic number.
452306125453451 is a deficient number, since it is larger than the sum of its proper divisors (1).
452306125453451 is an equidigital number, since it uses as much as digits as its factorization.
452306125453451 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640000, while the sum is 50.
The spelling of 452306125453451 in words is "four hundred fifty-two trillion, three hundred six billion, one hundred twenty-five million, four hundred fifty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •