Base | Representation |
---|---|
bin | 10011000100000010010… |
… | …010000001001110011000 |
3 | 11122020100101022220122201 |
4 | 103010002102001032120 |
5 | 132430341321201240 |
6 | 2441450205055544 |
7 | 163434050232115 |
oct | 23040222011630 |
9 | 4566311286581 |
10 | 1310003303320 |
11 | 465629793018 |
12 | 191a795575b4 |
13 | 966c06a032a |
14 | 47593d2b90c |
15 | 24122236d9a |
hex | 13102481398 |
1310003303320 has 32 divisors (see below), whose sum is σ = 3102639404400. Its totient is φ = 496422304128.
The previous prime is 1310003303311. The next prime is 1310003303333. The reversal of 1310003303320 is 233033000131.
It is a super-2 number, since 2×13100033033202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 861843519 + ... + 861845038.
Almost surely, 21310003303320 is an apocalyptic number.
1310003303320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1310003303320 is an abundant number, since it is smaller than the sum of its proper divisors (1792636101080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310003303320 is a wasteful number, since it uses less digits than its factorization.
1310003303320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1723688587 (or 1723688583 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 1310003303320 its reverse (233033000131), we get a palindrome (1543036303451).
The spelling of 1310003303320 in words is "one trillion, three hundred ten billion, three million, three hundred three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •