Base | Representation |
---|---|
bin | 10110111111011100… |
… | …00000100000000001 |
3 | 1011212020010100012211 |
4 | 23133232000200001 |
5 | 200234342030213 |
6 | 5400452022121 |
7 | 614610304312 |
oct | 133756004001 |
9 | 34766110184 |
10 | 12343314433 |
11 | 526452a90a |
12 | 2485901941 |
13 | 1219319968 |
14 | 851468609 |
15 | 4c398853d |
hex | 2dfb80801 |
12343314433 has 4 divisors (see below), whose sum is σ = 12345206320. Its totient is φ = 12341422548.
The previous prime is 12343314419. The next prime is 12343314439. The reversal of 12343314433 is 33441334321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12343314433 - 229 = 11806443521 is a prime.
It is a super-2 number, since 2×123433144332 (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 = 12343314395 and 12343314404.
It is not an unprimeable number, because it can be changed into a prime (12343314439) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 936123 + ... + 949216.
It is an arithmetic number, because the mean of its divisors is an integer number (3086301580).
Almost surely, 212343314433 is an apocalyptic number.
It is an amenable number.
12343314433 is a deficient number, since it is larger than the sum of its proper divisors (1891887).
12343314433 is an equidigital number, since it uses as much as digits as its factorization.
12343314433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1891886.
The product of its digits is 31104, while the sum is 31.
Adding to 12343314433 its reverse (33441334321), we get a palindrome (45784648754).
The spelling of 12343314433 in words is "twelve billion, three hundred forty-three million, three hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •