Base | Representation |
---|---|
bin | 1011100001101100001000… |
… | …1110100001100100110100 |
3 | 1122212120021212202210000120 |
4 | 2320123002032201210310 |
5 | 3130120122000020034 |
6 | 42542030220411540 |
7 | 2445423652344435 |
oct | 270330216414464 |
9 | 48776255683016 |
10 | 12673412110644 |
11 | 404684481771a |
12 | 15082380a6bb0 |
13 | 70c13666a9cc |
14 | 31b579ab948c |
15 | 16e9e7be9c49 |
hex | b86c23a1934 |
12673412110644 has 12 divisors (see below), whose sum is σ = 29571294924864. Its totient is φ = 4224470703544.
The previous prime is 12673412110609. The next prime is 12673412110657. The reversal of 12673412110644 is 44601121437621.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 12673412110596 and 12673412110605.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 528058837932 + ... + 528058837955.
It is an arithmetic number, because the mean of its divisors is an integer number (2464274577072).
Almost surely, 212673412110644 is an apocalyptic number.
It is an amenable number.
12673412110644 is an abundant number, since it is smaller than the sum of its proper divisors (16897882814220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12673412110644 is a wasteful number, since it uses less digits than its factorization.
12673412110644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056117675894 (or 1056117675892 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 42.
The spelling of 12673412110644 in words is "twelve trillion, six hundred seventy-three billion, four hundred twelve million, one hundred ten thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.337 sec. • engine limits •