Base | Representation |
---|---|
bin | 1011111100000100011000… |
… | …1001101011001000100100 |
3 | 1201110220001010002100021220 |
4 | 2333001012021223020210 |
5 | 3210031232312411133 |
6 | 43530135253340340 |
7 | 2523236211335220 |
oct | 277010611531044 |
9 | 51426033070256 |
10 | 13126596997668 |
11 | 4200a5a882900 |
12 | 15800329376b0 |
13 | 742aa98256ab |
14 | 33548b581780 |
15 | 17b6bd89d5b3 |
hex | bf04626b224 |
13126596997668 has 576 divisors, whose sum is σ = 40284534571008. Its totient is φ = 3252648960000.
The previous prime is 13126596997651. The next prime is 13126596997721. The reversal of 13126596997668 is 86679969562131.
It is a junction number, because it is equal to n+sod(n) for n = 13126596997593 and 13126596997602.
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 191 ways as a sum of consecutive naturals, for example, 9505138338 + ... + 9505139718.
Almost surely, 213126596997668 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13126596997668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20142267285504).
13126596997668 is an abundant number, since it is smaller than the sum of its proper divisors (27157937573340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13126596997668 is a wasteful number, since it uses less digits than its factorization.
13126596997668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1856 (or 1843 counting only the distinct ones).
The product of its digits is 1587237120, while the sum is 78.
The spelling of 13126596997668 in words is "thirteen trillion, one hundred twenty-six billion, five hundred ninety-six million, nine hundred ninety-seven thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •