Base | Representation |
---|---|
bin | 1100101111111001… |
… | …0100111010011001 |
3 | 22211111022101002222 |
4 | 3023332110322121 |
5 | 24002030112213 |
6 | 1323323433425 |
7 | 150542325044 |
oct | 31376247231 |
9 | 8744271088 |
10 | 3422113433 |
11 | 14a676a522 |
12 | 7b6085875 |
13 | 426c991bb |
14 | 2466c5c5b |
15 | 150674808 |
hex | cbf94e99 |
3422113433 has 4 divisors (see below), whose sum is σ = 3429909120. Its totient is φ = 3414317748.
The previous prime is 3422113391. The next prime is 3422113439. The reversal of 3422113433 is 3343112243.
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 a de Polignac number, because none of the positive numbers 2k-3422113433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3422113439) 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 3 ways as a sum of consecutive naturals, for example, 3897185 + ... + 3898062.
It is an arithmetic number, because the mean of its divisors is an integer number (857477280).
Almost surely, 23422113433 is an apocalyptic number.
It is an amenable number.
3422113433 is a deficient number, since it is larger than the sum of its proper divisors (7795687).
3422113433 is an equidigital number, since it uses as much as digits as its factorization.
3422113433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7795686.
The product of its digits is 5184, while the sum is 26.
The square root of 3422113433 is about 58498.8327490387. The cubic root of 3422113433 is about 1506.9475393027.
Adding to 3422113433 its reverse (3343112243), we get a palindrome (6765225676).
The spelling of 3422113433 in words is "three billion, four hundred twenty-two million, one hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •