Base | Representation |
---|---|
bin | 10110110110011001… |
… | …10100100100101100 |
3 | 1011122221110212112202 |
4 | 23123030310210230 |
5 | 200110440142324 |
6 | 5345143121032 |
7 | 613000036340 |
oct | 133314644454 |
9 | 34587425482 |
10 | 12267505964 |
11 | 522576188a |
12 | 2464443178 |
13 | 12066c638c |
14 | 845373620 |
15 | 4bbeb18ae |
hex | 2db33492c |
12267505964 has 12 divisors (see below), whose sum is σ = 24535011984. Its totient is φ = 5257502544.
The previous prime is 12267505919. The next prime is 12267505967. The reversal of 12267505964 is 46950576221.
12267505964 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
12267505964 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (12267505967) 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 3 ways as a sum of consecutive naturals, for example, 219062579 + ... + 219062634.
It is an arithmetic number, because the mean of its divisors is an integer number (2044584332).
Almost surely, 212267505964 is an apocalyptic number.
12267505964 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
12267505964 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12267505964 is a wasteful number, since it uses less digits than its factorization.
12267505964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438125224 (or 438125222 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 47.
The spelling of 12267505964 in words is "twelve billion, two hundred sixty-seven million, five hundred five thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •