Base | Representation |
---|---|
bin | 110100011101100010010010… |
… | …1110000100010101110101101 |
3 | 2020111212210011000120200101122 |
4 | 1220323010211300202232231 |
5 | 440440444311432403233 |
6 | 4313234020344550325 |
7 | 166125053116024136 |
oct | 15073044560425655 |
9 | 2214783130520348 |
10 | 461456214731693 |
11 | 124041533093a35 |
12 | 439093807823a5 |
13 | 16a6419918334c |
14 | 81d4858424c8d |
15 | 38538060d7d98 |
hex | 1a3b125c22bad |
461456214731693 has 2 divisors, whose sum is σ = 461456214731694. Its totient is φ = 461456214731692.
The previous prime is 461456214731647. The next prime is 461456214731717. The reversal of 461456214731693 is 396137412654164.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 264602210493604 + 196854004238089 = 16266598^2 + 14030467^2 .
It is a cyclic number.
It is not a de Polignac number, because 461456214731693 - 28 = 461456214731437 is a prime.
It is a super-2 number, since 2×4614562147316932 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (461456214739693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230728107365846 + 230728107365847.
It is an arithmetic number, because the mean of its divisors is an integer number (230728107365847).
Almost surely, 2461456214731693 is an apocalyptic number.
It is an amenable number.
461456214731693 is a deficient number, since it is larger than the sum of its proper divisors (1).
461456214731693 is an equidigital number, since it uses as much as digits as its factorization.
461456214731693 is an evil number, because the sum of its binary digits is even.
The product of its digits is 78382080, while the sum is 62.
The spelling of 461456214731693 in words is "four hundred sixty-one trillion, four hundred fifty-six billion, two hundred fourteen million, seven hundred thirty-one thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •