Base | Representation |
---|---|
bin | 1011011011100101111110… |
… | …1011010000011011011001 |
3 | 1122111112221212212001021010 |
4 | 2312321133223100123121 |
5 | 3121411123421424342 |
6 | 42421545513004133 |
7 | 2435025410610123 |
oct | 266713753203331 |
9 | 48445855761233 |
10 | 12568679483097 |
11 | 400638a9a3491 |
12 | 14aba893b3649 |
13 | 7022b551554a |
14 | 3164822b6213 |
15 | 16be1827029c |
hex | b6e5fad06d9 |
12568679483097 has 128 divisors (see below), whose sum is σ = 18381803102208. Its totient is φ = 7609809715200.
The previous prime is 12568679483093. The next prime is 12568679483111. The reversal of 12568679483097 is 79038497686521.
It is not a de Polignac number, because 12568679483097 - 22 = 12568679483093 is a prime.
It is a super-2 number, since 2×125686794830972 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12568679483093) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 16516004197 + ... + 16516004957.
It is an arithmetic number, because the mean of its divisors is an integer number (143607836736).
It is a 1-persistent number, because it is pandigital, but 2⋅12568679483097 = 25137358966194 is not.
Almost surely, 212568679483097 is an apocalyptic number.
12568679483097 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
12568679483097 is a deficient number, since it is larger than the sum of its proper divisors (5813123619111).
12568679483097 is a wasteful number, since it uses less digits than its factorization.
12568679483097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1399.
The product of its (nonzero) digits is 1097349120, while the sum is 75.
The spelling of 12568679483097 in words is "twelve trillion, five hundred sixty-eight billion, six hundred seventy-nine million, four hundred eighty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •