Base | Representation |
---|---|
bin | 110100110011000010011100… |
… | …1100111111100010001010101 |
3 | 2020220100022012220221121211222 |
4 | 1221212010321213330101111 |
5 | 441332404210243132411 |
6 | 4323415405142140125 |
7 | 166551423355202135 |
oct | 15146047147742125 |
9 | 2226308186847758 |
10 | 464411485520981 |
11 | 124a80894437669 |
12 | 44106082a21645 |
13 | 16c19a79c1325b |
14 | 82978c8a1aac5 |
15 | 38a561da7c4db |
hex | 1a661399fc455 |
464411485520981 has 2 divisors, whose sum is σ = 464411485520982. Its totient is φ = 464411485520980.
The previous prime is 464411485520963. The next prime is 464411485520987. The reversal of 464411485520981 is 189025584114464.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 453841242602500 + 10570242918481 = 21303550^2 + 3251191^2 .
It is a cyclic number.
It is not a de Polignac number, because 464411485520981 - 234 = 464394305651797 is a prime.
It is a super-2 number, since 2×4644114855209812 (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 (464411485520987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 232205742760490 + 232205742760491.
It is an arithmetic number, because the mean of its divisors is an integer number (232205742760491).
Almost surely, 2464411485520981 is an apocalyptic number.
It is an amenable number.
464411485520981 is a deficient number, since it is larger than the sum of its proper divisors (1).
464411485520981 is an equidigital number, since it uses as much as digits as its factorization.
464411485520981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44236800, while the sum is 62.
The spelling of 464411485520981 in words is "four hundred sixty-four trillion, four hundred eleven billion, four hundred eighty-five million, five hundred twenty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •