Base | Representation |
---|---|
bin | 10011000110110101101… |
… | …100010000010010101000 |
3 | 11122112010011011201012121 |
4 | 103012311230100102220 |
5 | 133003022401134230 |
6 | 2443105011521024 |
7 | 163601456631550 |
oct | 23066554202250 |
9 | 4575104151177 |
10 | 1313013302440 |
11 | 4669338629a4 |
12 | 1925795b9174 |
13 | 96a80175bb8 |
14 | 4779b9b8160 |
15 | 2424b60377a |
hex | 131b5b104a8 |
1313013302440 has 64 divisors (see below), whose sum is σ = 3454839020160. Its totient is φ = 439706776320.
The previous prime is 1313013302437. The next prime is 1313013302449. The reversal of 1313013302440 is 442033103131.
It is not an unprimeable number, because it can be changed into a prime (1313013302449) 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, 54515091 + ... + 54539170.
It is an arithmetic number, because the mean of its divisors is an integer number (53981859690).
Almost surely, 21313013302440 is an apocalyptic number.
1313013302440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1313013302440 is an abundant number, since it is smaller than the sum of its proper divisors (2141825717720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313013302440 is a wasteful number, since it uses less digits than its factorization.
1313013302440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109054322 (or 109054318 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1313013302440 its reverse (442033103131), we get a palindrome (1755046405571).
The spelling of 1313013302440 in words is "one trillion, three hundred thirteen billion, thirteen million, three hundred two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •