Base | Representation |
---|---|
bin | 10011000100100000101… |
… | …010011100101000101101 |
3 | 11122021122220110101100010 |
4 | 103010200222130220231 |
5 | 132432412313223113 |
6 | 2442012534123433 |
7 | 163452506621640 |
oct | 23044052345055 |
9 | 4567586411303 |
10 | 1310513023533 |
11 | 46587048939a |
12 | 191ba01b0579 |
13 | 9677217981c |
14 | 476018d3a57 |
15 | 24151d701c3 |
hex | 13120a9ca2d |
1310513023533 has 16 divisors (see below), whose sum is σ = 1997003318400. Its totient is φ = 748852925376.
The previous prime is 1310513023531. The next prime is 1310513023543. The reversal of 1310513023533 is 3353203150131.
It is not a de Polignac number, because 1310513023533 - 21 = 1310513023531 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1310513023533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310513023531) 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 in 15 ways as a sum of consecutive naturals, for example, 1000891 + ... + 1903367.
It is an arithmetic number, because the mean of its divisors is an integer number (124812707400).
Almost surely, 21310513023533 is an apocalyptic number.
It is an amenable number.
1310513023533 is a deficient number, since it is larger than the sum of its proper divisors (686490294867).
1310513023533 is an equidigital number, since it uses as much as digits as its factorization.
1310513023533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971636.
The product of its (nonzero) digits is 12150, while the sum is 30.
Adding to 1310513023533 its reverse (3353203150131), we get a palindrome (4663716173664).
The spelling of 1310513023533 in words is "one trillion, three hundred ten billion, five hundred thirteen million, twenty-three thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •