Base | Representation |
---|---|
bin | 10110110111000100… |
… | …00010110111111100 |
3 | 1011200022221112101000 |
4 | 23123202002313330 |
5 | 200113401211224 |
6 | 5345502250300 |
7 | 613065240630 |
oct | 133342026774 |
9 | 34608845330 |
10 | 12273069564 |
11 | 52289118a8 |
12 | 2466286990 |
13 | 12078c3852 |
14 | 845dc0dc0 |
15 | 4bc7100c9 |
hex | 2db882dfc |
12273069564 has 96 divisors (see below), whose sum is σ = 36802967040. Its totient is φ = 3464325504.
The previous prime is 12273069563. The next prime is 12273069577. The reversal of 12273069564 is 46596037221.
12273069564 is a `hidden beast` number, since 1 + 2 + 27 + 3 + 0 + 69 + 564 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12273069563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35049 + ... + 160544.
It is an arithmetic number, because the mean of its divisors is an integer number (383364240).
Almost surely, 212273069564 is an apocalyptic number.
12273069564 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
12273069564 is an abundant number, since it is smaller than the sum of its proper divisors (24529897476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12273069564 is a wasteful number, since it uses less digits than its factorization.
12273069564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195696 (or 195688 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 45.
The spelling of 12273069564 in words is "twelve billion, two hundred seventy-three million, sixty-nine thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •