Base | Representation |
---|---|
bin | 110011001101010110010000… |
… | …0110011011001000110000111 |
3 | 2012001212012002201122020001112 |
4 | 1212122230200303121012013 |
5 | 433014412340322323142 |
6 | 4233555032314115235 |
7 | 163606605201225446 |
oct | 14632544063310607 |
9 | 2161765081566045 |
10 | 450435245511047 |
11 | 1205825732a5205 |
12 | 4262945041bb1b |
13 | 16444b27633134 |
14 | 7d33279d8cd5d |
15 | 3711cc3a61382 |
hex | 199ab20cd9187 |
450435245511047 has 2 divisors, whose sum is σ = 450435245511048. Its totient is φ = 450435245511046.
The previous prime is 450435245510989. The next prime is 450435245511049. The reversal of 450435245511047 is 740115542534054.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 450435245511047 - 210 = 450435245510023 is a prime.
Together with 450435245511049, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 450435245510986 and 450435245511004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (450435245511049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225217622755523 + 225217622755524.
It is an arithmetic number, because the mean of its divisors is an integer number (225217622755524).
Almost surely, 2450435245511047 is an apocalyptic number.
450435245511047 is a deficient number, since it is larger than the sum of its proper divisors (1).
450435245511047 is an equidigital number, since it uses as much as digits as its factorization.
450435245511047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720000, while the sum is 50.
The spelling of 450435245511047 in words is "four hundred fifty trillion, four hundred thirty-five billion, two hundred forty-five million, five hundred eleven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •