Base | Representation |
---|---|
bin | 10110111010111010… |
… | …00000110110001001 |
3 | 1011202120121021000220 |
4 | 23131131000312021 |
5 | 200200124224334 |
6 | 5353013220253 |
7 | 613636236456 |
oct | 133535006611 |
9 | 34676537026 |
10 | 12305304969 |
11 | 5245029831 |
12 | 2475031689 |
13 | 121149c159 |
14 | 84a3b282d |
15 | 4c047b449 |
hex | 2dd740d89 |
12305304969 has 64 divisors (see below), whose sum is σ = 17814297600. Its totient is φ = 7539985152.
The previous prime is 12305304959. The next prime is 12305304983. The reversal of 12305304969 is 96940350321.
It is a happy number.
12305304969 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 12305304969 - 25 = 12305304937 is a prime.
It is a super-2 number, since 2×123053049692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12305304969.
It is not an unprimeable number, because it can be changed into a prime (12305304959) 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 63 ways as a sum of consecutive naturals, for example, 43481502 + ... + 43481784.
It is an arithmetic number, because the mean of its divisors is an integer number (278348400).
Almost surely, 212305304969 is an apocalyptic number.
It is an amenable number.
12305304969 is a deficient number, since it is larger than the sum of its proper divisors (5508992631).
12305304969 is a wasteful number, since it uses less digits than its factorization.
12305304969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614.
The product of its (nonzero) digits is 174960, while the sum is 42.
The spelling of 12305304969 in words is "twelve billion, three hundred five million, three hundred four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •