Base | Representation |
---|---|
bin | 10110000001011001100… |
… | …101010011100110001101 |
3 | 12100200011200002110102002 |
4 | 112001121211103212031 |
5 | 144243300322040023 |
6 | 3115114224442045 |
7 | 214222522666421 |
oct | 26013145234615 |
9 | 5320150073362 |
10 | 1513331440013 |
11 | 533889166608 |
12 | 205363779325 |
13 | ac925373653 |
14 | 53362030b81 |
15 | 2957296ab28 |
hex | 1605995398d |
1513331440013 has 8 divisors (see below), whose sum is σ = 1579149432000. Its totient is φ = 1447515195808.
The previous prime is 1513331440001. The next prime is 1513331440079. The reversal of 1513331440013 is 3100441333151.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1513331440013 - 210 = 1513331438989 is a prime.
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 (1513331440213) 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, 1518713 + ... + 2309361.
It is an arithmetic number, because the mean of its divisors is an integer number (197393679000).
Almost surely, 21513331440013 is an apocalyptic number.
It is an amenable number.
1513331440013 is a deficient number, since it is larger than the sum of its proper divisors (65817991987).
1513331440013 is an equidigital number, since it uses as much as digits as its factorization.
1513331440013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873891.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 1513331440013 its reverse (3100441333151), we get a palindrome (4613772773164).
The spelling of 1513331440013 in words is "one trillion, five hundred thirteen billion, three hundred thirty-one million, four hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •