Base | Representation |
---|---|
bin | 10110011110000011… |
… | …10010001001110101 |
3 | 1011010201012102020211 |
4 | 23033001302021311 |
5 | 144201200122002 |
6 | 5313010025421 |
7 | 604640144446 |
oct | 131701621165 |
9 | 34121172224 |
10 | 12063285877 |
11 | 5130457255 |
12 | 2407b78271 |
13 | 11a32c22a6 |
14 | 8261b32cd |
15 | 4a90c1dd7 |
hex | 2cf072275 |
12063285877 has 8 divisors (see below), whose sum is σ = 12732246560. Its totient is φ = 11397730320.
The previous prime is 12063285853. The next prime is 12063285889. The reversal of 12063285877 is 77858236021.
12063285877 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12063285877 - 215 = 12063253109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12063285877.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12063285977) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 843999 + ... + 858172.
It is an arithmetic number, because the mean of its divisors is an integer number (1591530820).
Almost surely, 212063285877 is an apocalyptic number.
It is an amenable number.
12063285877 is a deficient number, since it is larger than the sum of its proper divisors (668960683).
12063285877 is a wasteful number, since it uses less digits than its factorization.
12063285877 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1702563.
The product of its (nonzero) digits is 1128960, while the sum is 49.
The spelling of 12063285877 in words is "twelve billion, sixty-three million, two hundred eighty-five thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •