Base | Representation |
---|---|
bin | 1011100100001110110001… |
… | …0101001100010110101011 |
3 | 1200000201222100100121122020 |
4 | 2321003230111030112223 |
5 | 3131324023423043023 |
6 | 43014050201355523 |
7 | 2451530542642341 |
oct | 271035425142653 |
9 | 50021870317566 |
10 | 12717068174763 |
11 | 40633074a6857 |
12 | 15147a0498ba3 |
13 | 7132a2ccca04 |
14 | 31d71ba6b991 |
15 | 170c00669de3 |
hex | b90ec54c5ab |
12717068174763 has 8 divisors (see below), whose sum is σ = 16961523815376. Its totient is φ = 8475328992000.
The previous prime is 12717068174737. The next prime is 12717068174791. The reversal of 12717068174763 is 36747186071721.
12717068174763 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12717068174763 - 213 = 12717068166571 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12717068174697 and 12717068174706.
It is not an unprimeable number, because it can be changed into a prime (12717068174963) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 679103538 + ... + 679122263.
It is an arithmetic number, because the mean of its divisors is an integer number (2120190476922).
Almost surely, 212717068174763 is an apocalyptic number.
12717068174763 is a deficient number, since it is larger than the sum of its proper divisors (4244455640613).
12717068174763 is a wasteful number, since it uses less digits than its factorization.
12717068174763 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1358228925.
The product of its (nonzero) digits is 16595712, while the sum is 60.
The spelling of 12717068174763 in words is "twelve trillion, seven hundred seventeen billion, sixty-eight million, one hundred seventy-four thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •