Base | Representation |
---|---|
bin | 111011100111100… |
… | …0000100111110101 |
3 | 12011102011001001001 |
4 | 1313033000213311 |
5 | 13044102022123 |
6 | 530300003301 |
7 | 100400214142 |
oct | 16717004765 |
9 | 5142131031 |
10 | 2000423413 |
11 | 93720679a |
12 | 479b30531 |
13 | 25b594cc1 |
14 | 14d9693c9 |
15 | ba9480ad |
hex | 773c09f5 |
2000423413 has 4 divisors (see below), whose sum is σ = 2087398368. Its totient is φ = 1913448460.
The previous prime is 2000423401. The next prime is 2000423429. The reversal of 2000423413 is 3143240002.
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 not a de Polignac number, because 2000423413 - 217 = 2000292341 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 (2000423213) 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, 43487443 + ... + 43487488.
It is an arithmetic number, because the mean of its divisors is an integer number (521849592).
Almost surely, 22000423413 is an apocalyptic number.
2000423413 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2000423413 is a deficient number, since it is larger than the sum of its proper divisors (86974955).
2000423413 is an equidigital number, since it uses as much as digits as its factorization.
2000423413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86974954.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2000423413 is about 44726.0932007257. The cubic root of 2000423413 is about 1260.0099547798.
Adding to 2000423413 its reverse (3143240002), we get a palindrome (5143663415).
The spelling of 2000423413 in words is "two billion, four hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •