Base | Representation |
---|---|
bin | 110101000000110111101001… |
… | …0100101100101010010110101 |
3 | 2021011002000212211101120211002 |
4 | 1222001233102211211102311 |
5 | 442110030322401031321 |
6 | 4331432545523053045 |
7 | 200135650441222262 |
oct | 15201572245452265 |
9 | 2234060784346732 |
10 | 466312427361461 |
11 | 125643a9856200a |
12 | 44372580511185 |
13 | 170270c4b20a45 |
14 | 83218db578269 |
15 | 38d9cca36420b |
hex | 1a81bd29654b5 |
466312427361461 has 2 divisors, whose sum is σ = 466312427361462. Its totient is φ = 466312427361460.
The previous prime is 466312427361413. The next prime is 466312427361479. The reversal of 466312427361461 is 164163724213664.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 283808133719236 + 182504293642225 = 16846606^2 + 13509415^2 .
It is a cyclic number.
It is not a de Polignac number, because 466312427361461 - 242 = 461914380850357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 466312427361397 and 466312427361406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (466312427361401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 233156213680730 + 233156213680731.
It is an arithmetic number, because the mean of its divisors is an integer number (233156213680731).
Almost surely, 2466312427361461 is an apocalyptic number.
It is an amenable number.
466312427361461 is a deficient number, since it is larger than the sum of its proper divisors (1).
466312427361461 is an equidigital number, since it uses as much as digits as its factorization.
466312427361461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20901888, while the sum is 56.
The spelling of 466312427361461 in words is "four hundred sixty-six trillion, three hundred twelve billion, four hundred twenty-seven million, three hundred sixty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •