Base | Representation |
---|---|
bin | 1100110100101010… |
… | …1111000010101011 |
3 | 22212220000000001201 |
4 | 3031022233002223 |
5 | 24022142042103 |
6 | 1325321025031 |
7 | 151204510336 |
oct | 31512570253 |
9 | 8786000051 |
10 | 3442143403 |
11 | 1507000316 |
12 | 800925177 |
13 | 42b19015a |
14 | 24921b61d |
15 | 1522ce51d |
hex | cd2af0ab |
3442143403 has 4 divisors (see below), whose sum is σ = 3490624368. Its totient is φ = 3393662440.
The previous prime is 3442143401. The next prime is 3442143413. The reversal of 3442143403 is 3043412443.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3043412443 = 587 ⋅5184689.
It is a cyclic number.
It is not a de Polignac number, because 3442143403 - 21 = 3442143401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3442143401) 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, 24240376 + ... + 24240517.
It is an arithmetic number, because the mean of its divisors is an integer number (872656092).
Almost surely, 23442143403 is an apocalyptic number.
3442143403 is a deficient number, since it is larger than the sum of its proper divisors (48480965).
3442143403 is an equidigital number, since it uses as much as digits as its factorization.
3442143403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48480964.
The product of its (nonzero) digits is 13824, while the sum is 28.
The square root of 3442143403 is about 58669.7827079665. The cubic root of 3442143403 is about 1509.8819262089.
Adding to 3442143403 its reverse (3043412443), we get a palindrome (6485555846).
The spelling of 3442143403 in words is "three billion, four hundred forty-two million, one hundred forty-three thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •