Base | Representation |
---|---|
bin | 101011100110101… |
… | …0101010100110101 |
3 | 10202222002211201212 |
4 | 1113031111110311 |
5 | 10444024104023 |
6 | 401103331205 |
7 | 51154153415 |
oct | 12715252465 |
9 | 3688084655 |
10 | 1463113013 |
11 | 69098650a |
12 | 349bb0b05 |
13 | 1a417865b |
14 | dc460645 |
15 | 886aee78 |
hex | 57355535 |
1463113013 has 2 divisors, whose sum is σ = 1463113014. Its totient is φ = 1463113012.
The previous prime is 1463112997. The next prime is 1463113021. The reversal of 1463113013 is 3103113641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 895625329 + 567487684 = 29927^2 + 23822^2 .
It is a cyclic number.
It is not a de Polignac number, because 1463113013 - 24 = 1463112997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1463113013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1463113033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 731556506 + 731556507.
It is an arithmetic number, because the mean of its divisors is an integer number (731556507).
Almost surely, 21463113013 is an apocalyptic number.
It is an amenable number.
1463113013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1463113013 is an equidigital number, since it uses as much as digits as its factorization.
1463113013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 1463113013 is about 38250.6602949544. The cubic root of 1463113013 is about 1135.2529113537.
Adding to 1463113013 its reverse (3103113641), we get a palindrome (4566226654).
The spelling of 1463113013 in words is "one billion, four hundred sixty-three million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •