Base | Representation |
---|---|
bin | 1011100011001000110110… |
… | …0001110010110100001000 |
3 | 1122221221112012112102111210 |
4 | 2320302031201302310020 |
5 | 3131022103212221240 |
6 | 43001303434453120 |
7 | 2450264441111025 |
oct | 270621541626410 |
9 | 48857465472453 |
10 | 12698297773320 |
11 | 405635505a395 |
12 | 15110222941a0 |
13 | 7115a12b08b3 |
14 | 31c85abbc54c |
15 | 1704a2834780 |
hex | b8c8d872d08 |
12698297773320 has 64 divisors (see below), whose sum is σ = 38095516163520. Its totient is φ = 3386157375744.
The previous prime is 12698297773313. The next prime is 12698297773409. The reversal of 12698297773320 is 2337779289621.
It is a happy number.
It is a super-2 number, since 2×126982977733202 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6785847 + ... + 8452473.
It is an arithmetic number, because the mean of its divisors is an integer number (595242440055).
Almost surely, 212698297773320 is an apocalyptic number.
12698297773320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12698297773320 is an abundant number, since it is smaller than the sum of its proper divisors (25397218390200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12698297773320 is a wasteful number, since it uses less digits than its factorization.
12698297773320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1730134 (or 1730130 counting only the distinct ones).
The product of its (nonzero) digits is 96018048, while the sum is 66.
The spelling of 12698297773320 in words is "twelve trillion, six hundred ninety-eight billion, two hundred ninety-seven million, seven hundred seventy-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •