Base | Representation |
---|---|
bin | 10111001010010001… |
… | …00100110011010111 |
3 | 1012002120002000200211 |
4 | 23211020210303113 |
5 | 200431121234301 |
6 | 5413455150251 |
7 | 620062441525 |
oct | 134510446327 |
9 | 35076060624 |
10 | 12434164951 |
11 | 530084218a |
12 | 24b0215387 |
13 | 12320a8a70 |
14 | 85d557315 |
15 | 4cb932051 |
hex | 2e5224cd7 |
12434164951 has 4 divisors (see below), whose sum is σ = 13390639192. Its totient is φ = 11477690712.
The previous prime is 12434164933. The next prime is 12434164969. The reversal of 12434164951 is 15946143421.
12434164951 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 an interprime number because it is at equal distance from previous prime (12434164933) and next prime (12434164969).
It is a cyclic number.
It is not a de Polignac number, because 12434164951 - 211 = 12434162903 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12434164921) 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, 478237101 + ... + 478237126.
It is an arithmetic number, because the mean of its divisors is an integer number (3347659798).
Almost surely, 212434164951 is an apocalyptic number.
12434164951 is a deficient number, since it is larger than the sum of its proper divisors (956474241).
12434164951 is an equidigital number, since it uses as much as digits as its factorization.
12434164951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 956474240.
The product of its digits is 103680, while the sum is 40.
The spelling of 12434164951 in words is "twelve billion, four hundred thirty-four million, one hundred sixty-four thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •