Base | Representation |
---|---|
bin | 10010111011000110100… |
… | …100000000001010010000 |
3 | 11121022120220120021112001 |
4 | 102323012210000022100 |
5 | 132301220312400000 |
6 | 2433222322243344 |
7 | 162644256642145 |
oct | 22730644001220 |
9 | 4538526507461 |
10 | 1300411450000 |
11 | 4615573a8713 |
12 | 1900411b6554 |
13 | 95822417590 |
14 | 46d240903cc |
15 | 23c600eb46a |
hex | 12ec6900290 |
1300411450000 has 120 divisors (see below), whose sum is σ = 3391482759336. Its totient is φ = 480151680000.
The previous prime is 1300411449881. The next prime is 1300411450021. The reversal of 1300411450000 is 541140031.
It can be written as a sum of positive squares in 12 ways, for example, as 1260257702544 + 40153747456 = 1122612^2 + 200384^2 .
It is a super-2 number, since 2×13004114500002 (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 1300411450000.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 350317 + ... + 1650316.
Almost surely, 21300411450000 is an apocalyptic number.
1300411450000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1300411450000 is an abundant number, since it is smaller than the sum of its proper divisors (2091071309336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300411450000 is an equidigital number, since it uses as much as digits as its factorization.
1300411450000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2000679 (or 2000653 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 1300411450000 its reverse (541140031), we get a palindrome (1300952590031).
The spelling of 1300411450000 in words is "one trillion, three hundred billion, four hundred eleven million, four hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •