Base | Representation |
---|---|
bin | 1101001110000010100… |
… | …10001011011010111001 |
3 | 1121102101222101220020012 |
4 | 12213001102023122321 |
5 | 24420212332143022 |
6 | 544355125311305 |
7 | 44546566065134 |
oct | 6470122133271 |
9 | 1542358356205 |
10 | 454214334137 |
11 | 1656a4172023 |
12 | 74043565535 |
13 | 33aa85352b5 |
14 | 17dac4bb21b |
15 | bc3624ede2 |
hex | 69c148b6b9 |
454214334137 has 2 divisors, whose sum is σ = 454214334138. Its totient is φ = 454214334136.
The previous prime is 454214334121. The next prime is 454214334157. The reversal of 454214334137 is 731433412454.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 445554915001 + 8659419136 = 667499^2 + 93056^2 .
It is a cyclic number.
It is not a de Polignac number, because 454214334137 - 24 = 454214334121 is a prime.
It is a super-2 number, since 2×4542143341372 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 454214334094 and 454214334103.
It is not a weakly prime, because it can be changed into another prime (454214334157) 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, 227107167068 + 227107167069.
It is an arithmetic number, because the mean of its divisors is an integer number (227107167069).
Almost surely, 2454214334137 is an apocalyptic number.
It is an amenable number.
454214334137 is a deficient number, since it is larger than the sum of its proper divisors (1).
454214334137 is an equidigital number, since it uses as much as digits as its factorization.
454214334137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 483840, while the sum is 41.
The spelling of 454214334137 in words is "four hundred fifty-four billion, two hundred fourteen million, three hundred thirty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •