Base | Representation |
---|---|
bin | 111100000001110… |
… | …0101000110110101 |
3 | 12012101002011220210 |
4 | 1320003211012311 |
5 | 13111114014331 |
6 | 531511220033 |
7 | 100625311602 |
oct | 17003450665 |
9 | 5171064823 |
10 | 2014204341 |
11 | 943a69596 |
12 | 482677619 |
13 | 2613ab7b6 |
14 | 1517156a9 |
15 | bbc6b446 |
hex | 780e51b5 |
2014204341 has 4 divisors (see below), whose sum is σ = 2685605792. Its totient is φ = 1342802892.
The previous prime is 2014204331. The next prime is 2014204391. The reversal of 2014204341 is 1434024102.
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 not a de Polignac number, because 2014204341 - 214 = 2014187957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2014204331) 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, 335700721 + ... + 335700726.
It is an arithmetic number, because the mean of its divisors is an integer number (671401448).
Almost surely, 22014204341 is an apocalyptic number.
It is an amenable number.
2014204341 is a deficient number, since it is larger than the sum of its proper divisors (671401451).
2014204341 is an equidigital number, since it uses as much as digits as its factorization.
2014204341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671401450.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 2014204341 is about 44879.8879343521. The cubic root of 2014204341 is about 1262.8967410561.
Adding to 2014204341 its reverse (1434024102), we get a palindrome (3448228443).
It can be divided in two parts, 201420 and 4341, that added together give a triangular number (205761 = T641).
The spelling of 2014204341 in words is "two billion, fourteen million, two hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •