Base | Representation |
---|---|
bin | 10111001010011101… |
… | …01110011010010000 |
3 | 1012002200002221020120 |
4 | 23211032232122100 |
5 | 200432024332133 |
6 | 5413553510240 |
7 | 620112235053 |
oct | 134516563220 |
9 | 35080087216 |
10 | 12435777168 |
11 | 53017434a1 |
12 | 24b0872380 |
13 | 1232521839 |
14 | 85d856a9a |
15 | 4cbb4eab3 |
hex | 2e53ae690 |
12435777168 has 80 divisors (see below), whose sum is σ = 34033446720. Its totient is φ = 3899363328.
The previous prime is 12435777143. The next prime is 12435777173. The reversal of 12435777168 is 86177753421.
12435777168 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (51).
Its product of digits (1975680) is a multiple of the sum of its prime factors (8064).
It is a self number, because there is not a number n which added to its sum of digits gives 12435777168.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2500188 + ... + 2505156.
It is an arithmetic number, because the mean of its divisors is an integer number (425418084).
Almost surely, 212435777168 is an apocalyptic number.
It is an amenable number.
12435777168 is an abundant number, since it is smaller than the sum of its proper divisors (21597669552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12435777168 is a wasteful number, since it uses less digits than its factorization.
12435777168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8064 (or 8058 counting only the distinct ones).
The product of its digits is 1975680, while the sum is 51.
The spelling of 12435777168 in words is "twelve billion, four hundred thirty-five million, seven hundred seventy-seven thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •