Base | Representation |
---|---|
bin | 10010111011011001100… |
… | …110111111100110101100 |
3 | 11121100102011212011102220 |
4 | 102323121212333212230 |
5 | 132302344114020020 |
6 | 2433314135315340 |
7 | 162655220041365 |
oct | 22733146774654 |
9 | 4540364764386 |
10 | 1300731001260 |
11 | 461700816269 |
12 | 19011021bb50 |
13 | 9587369c472 |
14 | 46d546b2b6c |
15 | 23c7d1bd240 |
hex | 12ed99bf9ac |
1300731001260 has 48 divisors (see below), whose sum is σ = 3642285115392. Its totient is φ = 346838904000.
The previous prime is 1300731001249. The next prime is 1300731001307. The reversal of 1300731001260 is 621001370031.
It is a super-2 number, since 2×13007310012602 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1300731001260.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 225525 + ... + 1628595.
It is an arithmetic number, because the mean of its divisors is an integer number (75880939904).
Almost surely, 21300731001260 is an apocalyptic number.
1300731001260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1300731001260 is an abundant number, since it is smaller than the sum of its proper divisors (2341554114132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300731001260 is a wasteful number, since it uses less digits than its factorization.
1300731001260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1418534 (or 1418532 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 24.
Adding to 1300731001260 its reverse (621001370031), we get a palindrome (1921732371291).
The spelling of 1300731001260 in words is "one trillion, three hundred billion, seven hundred thirty-one million, one thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •