Base | Representation |
---|---|
bin | 10010111111111100000… |
… | …110010110110010101100 |
3 | 11121210222211102102010002 |
4 | 102333330012112302230 |
5 | 132342334240142330 |
6 | 2435441514003432 |
7 | 163220046056654 |
oct | 22777406266254 |
9 | 4553884372102 |
10 | 1305604615340 |
11 | 46378184a6a3 |
12 | 191050416578 |
13 | 9616c2a958c |
14 | 47297a75364 |
15 | 23e65eabe45 |
hex | 12ffc196cac |
1305604615340 has 24 divisors (see below), whose sum is σ = 2741918649120. Its totient is φ = 522213473408.
The previous prime is 1305604615321. The next prime is 1305604615349. The reversal of 1305604615340 is 435164065031.
It is a junction number, because it is equal to n+sod(n) for n = 1305604615294 and 1305604615303.
It is not an unprimeable number, because it can be changed into a prime (1305604615349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1393985 + ... + 2134104.
It is an arithmetic number, because the mean of its divisors is an integer number (114246610380).
Almost surely, 21305604615340 is an apocalyptic number.
1305604615340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1305604615340 is an abundant number, since it is smaller than the sum of its proper divisors (1436314033780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1305604615340 is a wasteful number, since it uses less digits than its factorization.
1305604615340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3546601 (or 3546599 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 1305604615340 in words is "one trillion, three hundred five billion, six hundred four million, six hundred fifteen thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •