Base | Representation |
---|---|
bin | 10110110001101100… |
… | …00010011011000111 |
3 | 1011120012002200200022 |
4 | 23120312002123013 |
5 | 200020330311301 |
6 | 5341212005355 |
7 | 612010051256 |
oct | 133066023307 |
9 | 34505080608 |
10 | 12227978951 |
11 | 5205414631 |
12 | 245316085b |
13 | 11cb466c06 |
14 | 84000479d |
15 | 4b87a4d1b |
hex | 2d8d826c7 |
12227978951 has 4 divisors (see below), whose sum is σ = 12262619472. Its totient is φ = 12193338432.
The previous prime is 12227978921. The next prime is 12227978989. The reversal of 12227978951 is 15987972221.
12227978951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12227978951 - 26 = 12227978887 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12227978893 and 12227978902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12227978921) 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, 17319731 + ... + 17320436.
It is an arithmetic number, because the mean of its divisors is an integer number (3065654868).
Almost surely, 212227978951 is an apocalyptic number.
12227978951 is a deficient number, since it is larger than the sum of its proper divisors (34640521).
12227978951 is an equidigital number, since it uses as much as digits as its factorization.
12227978951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34640520.
The product of its digits is 1270080, while the sum is 53.
The spelling of 12227978951 in words is "twelve billion, two hundred twenty-seven million, nine hundred seventy-eight thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •