Base | Representation |
---|---|
bin | 10110011110000001… |
… | …11010001010010111 |
3 | 1011010200202202122200 |
4 | 23033000322022113 |
5 | 144201120302120 |
6 | 5313001055543 |
7 | 604635201015 |
oct | 131700721227 |
9 | 34120682580 |
10 | 12063056535 |
11 | 513030aa12 |
12 | 2407a875b3 |
13 | 11a3241a9a |
14 | 8261538b5 |
15 | 4a9078e90 |
hex | 2cf03a297 |
12063056535 has 48 divisors (see below), whose sum is σ = 21611662176. Its totient is φ = 6219742464.
The previous prime is 12063056521. The next prime is 12063056581. The reversal of 12063056535 is 53565036021.
12063056535 is a `hidden beast` number, since 1 + 2 + 0 + 63 + 0 + 565 + 35 = 666.
12063056535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12063056535 - 216 = 12062990999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12063056535.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 238332 + ... + 284478.
It is an arithmetic number, because the mean of its divisors is an integer number (450242962).
Almost surely, 212063056535 is an apocalyptic number.
12063056535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12063056535 is a deficient number, since it is larger than the sum of its proper divisors (9548605641).
12063056535 is a wasteful number, since it uses less digits than its factorization.
12063056535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46352 (or 46349 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 36.
The spelling of 12063056535 in words is "twelve billion, sixty-three million, fifty-six thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •