Base | Representation |
---|---|
bin | 110011001011111000100111… |
… | …0000110011001010100110011 |
3 | 2012001010222000110220121012102 |
4 | 1212113301032012121110303 |
5 | 433003114010323121111 |
6 | 4233322413124051015 |
7 | 163556225520512333 |
oct | 14627611606312463 |
9 | 2161128013817172 |
10 | 450234142004531 |
11 | 120505255644255 |
12 | 425b6487233a6b |
13 | 1642bb88806231 |
14 | 7d2763d4d90c3 |
15 | 370b9537b213b |
hex | 1997c4e199533 |
450234142004531 has 2 divisors, whose sum is σ = 450234142004532. Its totient is φ = 450234142004530.
The previous prime is 450234142004489. The next prime is 450234142004533. The reversal of 450234142004531 is 135400241432054.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 450234142004531 - 210 = 450234142003507 is a prime.
It is a super-2 number, since 2×4502341420045312 (a number of 30 digits) contains 22 as substring.
Together with 450234142004533, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (450234142004533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225117071002265 + 225117071002266.
It is an arithmetic number, because the mean of its divisors is an integer number (225117071002266).
Almost surely, 2450234142004531 is an apocalyptic number.
450234142004531 is a deficient number, since it is larger than the sum of its proper divisors (1).
450234142004531 is an equidigital number, since it uses as much as digits as its factorization.
450234142004531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 450234142004531 its reverse (135400241432054), we get a palindrome (585634383436585).
The spelling of 450234142004531 in words is "four hundred fifty trillion, two hundred thirty-four billion, one hundred forty-two million, four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •