Base | Representation |
---|---|
bin | 111011101011010… |
… | …1011100001011101 |
3 | 12011112221012020110 |
4 | 1313112223201131 |
5 | 13100110343031 |
6 | 530411040233 |
7 | 100423260261 |
oct | 16726534135 |
9 | 5145835213 |
10 | 2002434141 |
11 | 93835a454 |
12 | 47a740079 |
13 | 25bb1a296 |
14 | 14dd300a1 |
15 | babe3c46 |
hex | 775ab85d |
2002434141 has 4 divisors (see below), whose sum is σ = 2669912192. Its totient is φ = 1334956092.
The previous prime is 2002434067. The next prime is 2002434173. The reversal of 2002434141 is 1414342002.
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 2002434141 - 226 = 1935325277 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 (2002434541) 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, 333739021 + ... + 333739026.
It is an arithmetic number, because the mean of its divisors is an integer number (667478048).
Almost surely, 22002434141 is an apocalyptic number.
It is an amenable number.
2002434141 is a deficient number, since it is larger than the sum of its proper divisors (667478051).
2002434141 is an equidigital number, since it uses as much as digits as its factorization.
2002434141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667478050.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 2002434141 is about 44748.5657982465. The cubic root of 2002434141 is about 1260.4319802522.
Adding to 2002434141 its reverse (1414342002), we get a palindrome (3416776143).
The spelling of 2002434141 in words is "two billion, two million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •