Base | Representation |
---|---|
bin | 1011011101110001001101… |
… | …0111111000001011000001 |
3 | 1122122010102120200021020220 |
4 | 2313130103113320023001 |
5 | 3123014144313242012 |
6 | 42451050303253253 |
7 | 2440520525241456 |
oct | 267342327701301 |
9 | 48563376607226 |
10 | 12606054040257 |
11 | 4020219959457 |
12 | 14b7179baa229 |
13 | 705990687222 |
14 | 3181c9cdb82d |
15 | 16cda44ed08c |
hex | b77135f82c1 |
12606054040257 has 8 divisors (see below), whose sum is σ = 16817292067584. Its totient is φ = 8399426019888.
The previous prime is 12606054040247. The next prime is 12606054040273. The reversal of 12606054040257 is 75204045060621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12606054040257 - 210 = 12606054039233 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (12606054040207) 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, 1152495358 + ... + 1152506295.
It is an arithmetic number, because the mean of its divisors is an integer number (2102161508448).
Almost surely, 212606054040257 is an apocalyptic number.
It is an amenable number.
12606054040257 is a deficient number, since it is larger than the sum of its proper divisors (4211238027327).
12606054040257 is a wasteful number, since it uses less digits than its factorization.
12606054040257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2305003479.
The product of its (nonzero) digits is 403200, while the sum is 42.
The spelling of 12606054040257 in words is "twelve trillion, six hundred six billion, fifty-four million, forty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •