Base | Representation |
---|---|
bin | 1011100011010011100010… |
… | …1011101111011000001001 |
3 | 1122222012221022210022111001 |
4 | 2320310320223233120021 |
5 | 3131043443314101432 |
6 | 43002500413135001 |
7 | 2450425546416052 |
oct | 270647053573011 |
9 | 48865838708431 |
10 | 12701169284617 |
11 | 4057598a40320 |
12 | 15116a3a8a461 |
13 | 71193b1884c8 |
14 | 31ca502d9729 |
15 | 1705be9979e7 |
hex | b8d38aef609 |
12701169284617 has 8 divisors (see below), whose sum is σ = 13855959520992. Its totient is φ = 11546402128800.
The previous prime is 12701169284593. The next prime is 12701169284621. The reversal of 12701169284617 is 71648296110721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-12701169284617 is a prime.
It is a super-2 number, since 2×127011692846172 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12701169284717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4609359 + ... + 6829972.
It is an arithmetic number, because the mean of its divisors is an integer number (1731994940124).
Almost surely, 212701169284617 is an apocalyptic number.
It is an amenable number.
12701169284617 is a deficient number, since it is larger than the sum of its proper divisors (1154790236375).
12701169284617 is a wasteful number, since it uses less digits than its factorization.
12701169284617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11540279.
The product of its (nonzero) digits is 2032128, while the sum is 55.
The spelling of 12701169284617 in words is "twelve trillion, seven hundred one billion, one hundred sixty-nine million, two hundred eighty-four thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •