Base | Representation |
---|---|
bin | 10110110010001110… |
… | …00010001011111111 |
3 | 1011120111111001110002 |
4 | 23121013002023333 |
5 | 200023000400211 |
6 | 5341451304515 |
7 | 612062656100 |
oct | 133107021377 |
9 | 34514431402 |
10 | 12232434431 |
11 | 5207988048 |
12 | 245474b13b |
13 | 11cc366ba9 |
14 | 8408443a7 |
15 | 4b8d8503b |
hex | 2d91c22ff |
12232434431 has 12 divisors (see below), whose sum is σ = 14254873272. Its totient is φ = 10466296848.
The previous prime is 12232434427. The next prime is 12232434433. The reversal of 12232434431 is 13443423221.
It is not a de Polignac number, because 12232434431 - 22 = 12232434427 is a prime.
It is a super-2 number, since 2×122324344312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12232434394 and 12232434403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12232434433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 194120 + ... + 249293.
It is an arithmetic number, because the mean of its divisors is an integer number (1187906106).
Almost surely, 212232434431 is an apocalyptic number.
12232434431 is a deficient number, since it is larger than the sum of its proper divisors (2022438841).
12232434431 is an equidigital number, since it uses as much as digits as its factorization.
12232434431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443990 (or 443983 counting only the distinct ones).
The product of its digits is 13824, while the sum is 29.
Adding to 12232434431 its reverse (13443423221), we get a palindrome (25675857652).
The spelling of 12232434431 in words is "twelve billion, two hundred thirty-two million, four hundred thirty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •