Base | Representation |
---|---|
bin | 110100110101100010000100… |
… | …1001100001011011000100001 |
3 | 2020221120002000012000122101221 |
4 | 1221223010021030023120201 |
5 | 441404013221200221121 |
6 | 4324241055254055041 |
7 | 166615250034003403 |
oct | 15153041114133041 |
9 | 2227502005018357 |
10 | 464754270320161 |
11 | 1250a31a7527828 |
12 | 441605a894a481 |
13 | 16c431a7a2b783 |
14 | 82aa326114b73 |
15 | 38ae4d2458b41 |
hex | 1a6b10930b621 |
464754270320161 has 2 divisors, whose sum is σ = 464754270320162. Its totient is φ = 464754270320160.
The previous prime is 464754270320099. The next prime is 464754270320203. The reversal of 464754270320161 is 161023072457464.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 274039385598225 + 190714884721936 = 16554135^2 + 13809956^2 .
It is a cyclic number.
It is not a de Polignac number, because 464754270320161 - 217 = 464754270189089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 464754270320099 and 464754270320108.
It is not a weakly prime, because it can be changed into another prime (464754270329161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 232377135160080 + 232377135160081.
It is an arithmetic number, because the mean of its divisors is an integer number (232377135160081).
Almost surely, 2464754270320161 is an apocalyptic number.
It is an amenable number.
464754270320161 is a deficient number, since it is larger than the sum of its proper divisors (1).
464754270320161 is an equidigital number, since it uses as much as digits as its factorization.
464754270320161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6773760, while the sum is 52.
The spelling of 464754270320161 in words is "four hundred sixty-four trillion, seven hundred fifty-four billion, two hundred seventy million, three hundred twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •