Base | Representation |
---|---|
bin | 11001000010111100… |
… | …10010011000110001 |
3 | 1021201002221110010011 |
4 | 30201132102120301 |
5 | 210014300132044 |
6 | 10102140534521 |
7 | 654134163505 |
oct | 144136223061 |
9 | 37632843104 |
10 | 13446489649 |
11 | 578021376a |
12 | 2733251441 |
13 | 1363a3c968 |
14 | 917b92305 |
15 | 53a74a134 |
hex | 321792631 |
13446489649 has 2 divisors, whose sum is σ = 13446489650. Its totient is φ = 13446489648.
The previous prime is 13446489613. The next prime is 13446489659. The reversal of 13446489649 is 94698464431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7392560400 + 6053929249 = 85980^2 + 77807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13446489649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13446489593 and 13446489602.
It is not a weakly prime, because it can be changed into another prime (13446489659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6723244824 + 6723244825.
It is an arithmetic number, because the mean of its divisors is an integer number (6723244825).
Almost surely, 213446489649 is an apocalyptic number.
It is an amenable number.
13446489649 is a deficient number, since it is larger than the sum of its proper divisors (1).
13446489649 is an equidigital number, since it uses as much as digits as its factorization.
13446489649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17915904, while the sum is 58.
The spelling of 13446489649 in words is "thirteen billion, four hundred forty-six million, four hundred eighty-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •