Base | Representation |
---|---|
bin | 10011000110111100110… |
… | …100111000000100001101 |
3 | 11122112102111102010112110 |
4 | 103012330310320010031 |
5 | 133003244022044041 |
6 | 2443124525254233 |
7 | 163604442235050 |
oct | 23067464700415 |
9 | 4575374363473 |
10 | 1313133003021 |
11 | 46699538a7a4 |
12 | 1925b1704379 |
13 | 96a9bbc6748 |
14 | 477ad856a97 |
15 | 24256d9a516 |
hex | 131bcd3810d |
1313133003021 has 16 divisors (see below), whose sum is σ = 2020391419904. Its totient is φ = 743076649584.
The previous prime is 1313133003011. The next prime is 1313133003029. The reversal of 1313133003021 is 1203003313131.
It is not a de Polignac number, because 1313133003021 - 213 = 1313132994829 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313133003029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 303542221 + ... + 303546546.
It is an arithmetic number, because the mean of its divisors is an integer number (126274463744).
Almost surely, 21313133003021 is an apocalyptic number.
It is an amenable number.
1313133003021 is a deficient number, since it is larger than the sum of its proper divisors (707258416883).
1313133003021 is a wasteful number, since it uses less digits than its factorization.
1313133003021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607088880.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1313133003021 its reverse (1203003313131), we get a palindrome (2516136316152).
The spelling of 1313133003021 in words is "one trillion, three hundred thirteen billion, one hundred thirty-three million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •