Base | Representation |
---|---|
bin | 1011001011001101100011… |
… | …0001110110001000111100 |
3 | 1121111122112010020022121101 |
4 | 2302303120301312020330 |
5 | 3102303233303141103 |
6 | 42044403125142444 |
7 | 2405503226513314 |
oct | 262633061661074 |
9 | 47448463208541 |
10 | 12287243412028 |
11 | 3a07a9963a812 |
12 | 1465424b5aa24 |
13 | 6b18b36c3690 |
14 | 3069c4838444 |
15 | 16494570ea1d |
hex | b2cd8c7623c |
12287243412028 has 96 divisors (see below), whose sum is σ = 24763278621312. Its totient is φ = 5289944985600.
The previous prime is 12287243411957. The next prime is 12287243412043. The reversal of 12287243412028 is 82021434278221.
12287243412028 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 119645550 + ... + 119748202.
It is an arithmetic number, because the mean of its divisors is an integer number (257950818972).
Almost surely, 212287243412028 is an apocalyptic number.
It is an amenable number.
12287243412028 is an abundant number, since it is smaller than the sum of its proper divisors (12476035209284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12287243412028 is a wasteful number, since it uses less digits than its factorization.
12287243412028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105175 (or 105173 counting only the distinct ones).
The product of its (nonzero) digits is 688128, while the sum is 46.
The spelling of 12287243412028 in words is "twelve trillion, two hundred eighty-seven billion, two hundred forty-three million, four hundred twelve thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •