Base | Representation |
---|---|
bin | 10011000100001110101… |
… | …111010110111100001001 |
3 | 11122020212221122010001111 |
4 | 103010032233112330021 |
5 | 132431303323233113 |
6 | 2441523033050321 |
7 | 163442165655160 |
oct | 23041657267411 |
9 | 4566787563044 |
10 | 1310212321033 |
11 | 465726775130 |
12 | 191b175569a1 |
13 | 96724a94055 |
14 | 475b39ba3d7 |
15 | 2413577313d |
hex | 1310ebd6f09 |
1310212321033 has 16 divisors (see below), whose sum is σ = 1635039642240. Its totient is φ = 1019989555200.
The previous prime is 1310212321027. The next prime is 1310212321039. The reversal of 1310212321033 is 3301232120131.
It is an interprime number because it is at equal distance from previous prime (1310212321027) and next prime (1310212321039).
It is a de Polignac number, because none of the positive numbers 2k-1310212321033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1310212320995 and 1310212321013.
It is not an unprimeable number, because it can be changed into a prime (1310212321039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7876408 + ... + 8041033.
It is an arithmetic number, because the mean of its divisors is an integer number (102189977640).
Almost surely, 21310212321033 is an apocalyptic number.
It is an amenable number.
1310212321033 is a deficient number, since it is larger than the sum of its proper divisors (324827321207).
1310212321033 is a wasteful number, since it uses less digits than its factorization.
1310212321033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15918528.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1310212321033 its reverse (3301232120131), we get a palindrome (4611444441164).
The spelling of 1310212321033 in words is "one trillion, three hundred ten billion, two hundred twelve million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •