Base | Representation |
---|---|
bin | 1011100001000010000110… |
… | …0101110011011100010101 |
3 | 1122211111011102010012211201 |
4 | 2320100201211303130111 |
5 | 3124424014022144043 |
6 | 42532522332432501 |
7 | 2444544212625226 |
oct | 270204145633425 |
9 | 48744142105751 |
10 | 12662127146773 |
11 | 4041a837452a5 |
12 | 1506008918731 |
13 | 70b0586ab4b0 |
14 | 31abc902b24d |
15 | 16e58711bc4d |
hex | b8421973715 |
12662127146773 has 32 divisors (see below), whose sum is σ = 14994355138560. Its totient is φ = 10579889960640.
The previous prime is 12662127146759. The next prime is 12662127146777. The reversal of 12662127146773 is 37764172126621.
It is a de Polignac number, because none of the positive numbers 2k-12662127146773 is a prime.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12662127146777) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3952090 + ... + 6398692.
It is an arithmetic number, because the mean of its divisors is an integer number (468573598080).
Almost surely, 212662127146773 is an apocalyptic number.
12662127146773 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12662127146773 is a deficient number, since it is larger than the sum of its proper divisors (2332227991787).
12662127146773 is a wasteful number, since it uses less digits than its factorization.
12662127146773 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2447569.
The product of its digits is 7112448, while the sum is 55.
The spelling of 12662127146773 in words is "twelve trillion, six hundred sixty-two billion, one hundred twenty-seven million, one hundred forty-six thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •