Base | Representation |
---|---|
bin | 1100000010101011010001… |
… | …0011111001011110010100 |
3 | 1201212202001022221212121121 |
4 | 3000222310103321132110 |
5 | 3213411223231240200 |
6 | 44054231411453324 |
7 | 2534365242556426 |
oct | 300526423713624 |
9 | 51782038855547 |
10 | 13240114321300 |
11 | 4245112402249 |
12 | 159a0335b7244 |
13 | 7506ca946089 |
14 | 33ab79952816 |
15 | 17e614675e1a |
hex | c0ab44f9794 |
13240114321300 has 54 divisors (see below), whose sum is σ = 28922584978014. Its totient is φ = 5260971672000.
The previous prime is 13240114321241. The next prime is 13240114321339. The reversal of 13240114321300 is 312341104231.
It can be written as a sum of positive squares in 3 ways, for example, as 56345466384 + 13183768854916 = 237372^2 + 3630946^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 623307 + ... + 5183506.
Almost surely, 213240114321300 is an apocalyptic number.
13240114321300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13240114321300 is an abundant number, since it is smaller than the sum of its proper divisors (15682470656714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13240114321300 is a wasteful number, since it uses less digits than its factorization.
13240114321300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5807129 (or 5806971 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13240114321300 its reverse (312341104231), we get a palindrome (13552455425531).
The spelling of 13240114321300 in words is "thirteen trillion, two hundred forty billion, one hundred fourteen million, three hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •