Base | Representation |
---|---|
bin | 10011001001010000110… |
… | …111001011010010111000 |
3 | 11122202211120210122210111 |
4 | 103021100313023102320 |
5 | 133023340324242130 |
6 | 2444215210154104 |
7 | 164023130606602 |
oct | 23112067132270 |
9 | 4582746718714 |
10 | 1315616634040 |
11 | 467a4a323515 |
12 | 192b85422934 |
13 | 970a66143b7 |
14 | 47967646172 |
15 | 2434ee4102a |
hex | 13250dcb4b8 |
1315616634040 has 32 divisors (see below), whose sum is σ = 2986333343280. Its totient is φ = 521589601792.
The previous prime is 1315616633999. The next prime is 1315616634047. The reversal of 1315616634040 is 404366165131.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 1315616633984 and 1315616634002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1315616634047) 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 7 ways as a sum of consecutive naturals, for example, 145528294 + ... + 145537333.
Almost surely, 21315616634040 is an apocalyptic number.
1315616634040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1315616634040 is an abundant number, since it is smaller than the sum of its proper divisors (1670716709240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1315616634040 is a wasteful number, since it uses less digits than its factorization.
1315616634040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291065751 (or 291065747 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 1315616634040 in words is "one trillion, three hundred fifteen billion, six hundred sixteen million, six hundred thirty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •