Base | Representation |
---|---|
bin | 10110101001001000… |
… | …10110101001010111 |
3 | 1011101012002200120000 |
4 | 23110210112221113 |
5 | 144343443444302 |
6 | 5330130142343 |
7 | 610146200256 |
oct | 132444265127 |
9 | 34335080500 |
10 | 12156234327 |
11 | 5178971856 |
12 | 24331219b3 |
13 | 11b9637283 |
14 | 83468a79d |
15 | 4b233231c |
hex | 2d4916a57 |
12156234327 has 20 divisors (see below), whose sum is σ = 18163181256. Its totient is φ = 8102430000.
The previous prime is 12156234323. The next prime is 12156234329. The reversal of 12156234327 is 72343265121.
12156234327 is a `hidden beast` number, since 1 + 2 + 1 + 5 + 623 + 4 + 3 + 27 = 666.
12156234327 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 12156234327 - 22 = 12156234323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12156234291 and 12156234300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12156234323) 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 19 ways as a sum of consecutive naturals, for example, 449952 + ... + 476202.
Almost surely, 212156234327 is an apocalyptic number.
12156234327 is a deficient number, since it is larger than the sum of its proper divisors (6006946929).
12156234327 is an equidigital number, since it uses as much as digits as its factorization.
12156234327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31980 (or 31971 counting only the distinct ones).
The product of its digits is 60480, while the sum is 36.
Adding to 12156234327 its reverse (72343265121), we get a palindrome (84499499448).
The spelling of 12156234327 in words is "twelve billion, one hundred fifty-six million, two hundred thirty-four thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •