Base | Representation |
---|---|
bin | 10011100001000000000… |
… | …011010111010111001100 |
3 | 11202012121212120100120012 |
4 | 103201000003113113030 |
5 | 133433040212422200 |
6 | 2504032254012352 |
7 | 165614550325421 |
oct | 23410003272714 |
9 | 4665555510505 |
10 | 1341104420300 |
11 | 477839534587 |
12 | 197ab91a70b8 |
13 | 99608c17628 |
14 | 48ca46c5d48 |
15 | 24d42867a35 |
hex | 138400d75cc |
1341104420300 has 36 divisors (see below), whose sum is σ = 2914599453696. Its totient is φ = 535630180800.
The previous prime is 1341104420263. The next prime is 1341104420323. The reversal of 1341104420300 is 30244011431.
It is a super-2 number, since 2×13411044203002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10078412 + ... + 10210611.
It is an arithmetic number, because the mean of its divisors is an integer number (80961095936).
Almost surely, 21341104420300 is an apocalyptic number.
1341104420300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1341104420300 is an abundant number, since it is smaller than the sum of its proper divisors (1573495033396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1341104420300 is a wasteful number, since it uses less digits than its factorization.
1341104420300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20289698 (or 20289691 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1341104420300 its reverse (30244011431), we get a palindrome (1371348431731).
The spelling of 1341104420300 in words is "one trillion, three hundred forty-one billion, one hundred four million, four hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •