Base | Representation |
---|---|
bin | 1100110000001000… |
… | …1111110010010101 |
3 | 22211120020120200111 |
4 | 3030002033302111 |
5 | 24002311003023 |
6 | 1323401443021 |
7 | 150554134645 |
oct | 31402176225 |
9 | 8746216614 |
10 | 3423141013 |
11 | 14a7301566 |
12 | 7b64a0471 |
13 | 427268b36 |
14 | 2468b2525 |
15 | 1507c900d |
hex | cc08fc95 |
3423141013 has 2 divisors, whose sum is σ = 3423141014. Its totient is φ = 3423141012.
The previous prime is 3423141011. The next prime is 3423141031. The reversal of 3423141013 is 3101413243.
Together with next prime (3423141031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1922120964 + 1501020049 = 43842^2 + 38743^2 .
It is a cyclic number.
It is not a de Polignac number, because 3423141013 - 21 = 3423141011 is a prime.
Together with 3423141011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3423141011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1711570506 + 1711570507.
It is an arithmetic number, because the mean of its divisors is an integer number (1711570507).
Almost surely, 23423141013 is an apocalyptic number.
It is an amenable number.
3423141013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3423141013 is an equidigital number, since it uses as much as digits as its factorization.
3423141013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 3423141013 is about 58507.6150001006. The cubic root of 3423141013 is about 1507.0983578164.
Adding to 3423141013 its reverse (3101413243), we get a palindrome (6524554256).
The spelling of 3423141013 in words is "three billion, four hundred twenty-three million, one hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •