Base | Representation |
---|---|
bin | 1011111011100001001101… |
… | …1110001000010001100100 |
3 | 1201102222200012122222011212 |
4 | 2332320103132020101210 |
5 | 3204402414114143200 |
6 | 43521534425050552 |
7 | 2522453242020056 |
oct | 276702336102144 |
9 | 51388605588155 |
10 | 13117156787300 |
11 | 41a7a56052055 |
12 | 157a239326a58 |
13 | 741c33ac55b7 |
14 | 334c338d98d6 |
15 | 17b319c19035 |
hex | bee13788464 |
13117156787300 has 36 divisors (see below), whose sum is σ = 28492329392436. Its totient is φ = 5241683145600.
The previous prime is 13117156787297. The next prime is 13117156787321. The reversal of 13117156787300 is 378765171131.
It can be written as a sum of positive squares in 6 ways, for example, as 4368008040484 + 8749148746816 = 2089978^2 + 2957896^2 .
It is a super-2 number, since 2×131171567873002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 64642811 + ... + 64845410.
Almost surely, 213117156787300 is an apocalyptic number.
13117156787300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13117156787300 is an abundant number, since it is smaller than the sum of its proper divisors (15375172605136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13117156787300 is a wasteful number, since it uses less digits than its factorization.
13117156787300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129489248 (or 129489241 counting only the distinct ones).
The product of its (nonzero) digits is 740880, while the sum is 50.
The spelling of 13117156787300 in words is "thirteen trillion, one hundred seventeen billion, one hundred fifty-six million, seven hundred eighty-seven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •