Base | Representation |
---|---|
bin | 110100011101100001110011… |
… | …1000110111111010111001101 |
3 | 2020111212200102202210021110211 |
4 | 1220323003213012333113031 |
5 | 440440440133343322113 |
6 | 4313233324200402421 |
7 | 166125015064006402 |
oct | 15073034706772715 |
9 | 2214780382707424 |
10 | 461455163651533 |
11 | 124041043851947 |
12 | 43909128776411 |
13 | 16a6405c4a021c |
14 | 81d47989bc2a9 |
15 | 3853793bb6b3d |
hex | 1a3b0e71bf5cd |
461455163651533 has 2 divisors, whose sum is σ = 461455163651534. Its totient is φ = 461455163651532.
The previous prime is 461455163651491. The next prime is 461455163651557. The reversal of 461455163651533 is 335156361554164.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 452494708117929 + 8960455533604 = 21271923^2 + 2993402^2 .
It is a cyclic number.
It is not a de Polignac number, because 461455163651533 - 241 = 459256140395981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (461455163651593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230727581825766 + 230727581825767.
It is an arithmetic number, because the mean of its divisors is an integer number (230727581825767).
Almost surely, 2461455163651533 is an apocalyptic number.
It is an amenable number.
461455163651533 is a deficient number, since it is larger than the sum of its proper divisors (1).
461455163651533 is an equidigital number, since it uses as much as digits as its factorization.
461455163651533 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 58320000, while the sum is 58.
The spelling of 461455163651533 in words is "four hundred sixty-one trillion, four hundred fifty-five billion, one hundred sixty-three million, six hundred fifty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •