Base | Representation |
---|---|
bin | 1101010101001001010… |
… | …00111101011000001001 |
3 | 1121210020210212111002202 |
4 | 12222210220331120021 |
5 | 30001020323441321 |
6 | 550225425205545 |
7 | 45043244000261 |
oct | 6524450753011 |
9 | 1553223774082 |
10 | 458028733961 |
11 | 167281309077 |
12 | 74928a908b5 |
13 | 34265871b06 |
14 | 18250d1a7a1 |
15 | bdab06270b |
hex | 6aa4a3d609 |
458028733961 has 2 divisors, whose sum is σ = 458028733962. Its totient is φ = 458028733960.
The previous prime is 458028733957. The next prime is 458028733969. The reversal of 458028733961 is 169337820854.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 394760890000 + 63267843961 = 628300^2 + 251531^2 .
It is a cyclic number.
It is not a de Polignac number, because 458028733961 - 22 = 458028733957 is a prime.
It is a super-2 number, since 2×4580287339612 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 458028733897 and 458028733906.
It is not a weakly prime, because it can be changed into another prime (458028733969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 229014366980 + 229014366981.
It is an arithmetic number, because the mean of its divisors is an integer number (229014366981).
It is a 1-persistent number, because it is pandigital, but 2⋅458028733961 = 916057467922 is not.
Almost surely, 2458028733961 is an apocalyptic number.
It is an amenable number.
458028733961 is a deficient number, since it is larger than the sum of its proper divisors (1).
458028733961 is an equidigital number, since it uses as much as digits as its factorization.
458028733961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8709120, while the sum is 56.
The spelling of 458028733961 in words is "four hundred fifty-eight billion, twenty-eight million, seven hundred thirty-three thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •