Base | Representation |
---|---|
bin | 10110101010000110… |
… | …00101101100100111 |
3 | 1011101202021000201220 |
4 | 23111003011230213 |
5 | 144403024310432 |
6 | 5331014551423 |
7 | 610304525214 |
oct | 132503055447 |
9 | 34352230656 |
10 | 12164291367 |
11 | 5182475168 |
12 | 2435968573 |
13 | 11bb1c8657 |
14 | 835786b0b |
15 | 4b2dc472c |
hex | 2d50c5b27 |
12164291367 has 16 divisors (see below), whose sum is σ = 17765295840. Its totient is φ = 7369306112.
The previous prime is 12164291351. The next prime is 12164291369. The reversal of 12164291367 is 76319246121.
12164291367 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12164291367 - 24 = 12164291351 is a prime.
It is a super-2 number, since 2×121642913672 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12164291369) 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 15 ways as a sum of consecutive naturals, for example, 4110858 + ... + 4113815.
It is an arithmetic number, because the mean of its divisors is an integer number (1110330990).
Almost surely, 212164291367 is an apocalyptic number.
12164291367 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
12164291367 is a deficient number, since it is larger than the sum of its proper divisors (5601004473).
12164291367 is a wasteful number, since it uses less digits than its factorization.
12164291367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8224722.
The product of its digits is 108864, while the sum is 42.
The spelling of 12164291367 in words is "twelve billion, one hundred sixty-four million, two hundred ninety-one thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •