Base | Representation |
---|---|
bin | 111011101110100… |
… | …0010010101000111 |
3 | 12011200001211221121 |
4 | 1313131002111013 |
5 | 13101022203143 |
6 | 530510454411 |
7 | 100443400243 |
oct | 16735022507 |
9 | 5150054847 |
10 | 2004100423 |
11 | 939298346 |
12 | 47b204407 |
13 | 25c281850 |
14 | 150245423 |
15 | bae227ed |
hex | 77742547 |
2004100423 has 16 divisors (see below), whose sum is σ = 2254242816. Its totient is φ = 1767823200.
The previous prime is 2004100421. The next prime is 2004100451. The reversal of 2004100423 is 3240014002.
It is not a de Polignac number, because 2004100423 - 21 = 2004100421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2004100397 and 2004100406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2004100421) 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 15 ways as a sum of consecutive naturals, for example, 394248 + ... + 399298.
It is an arithmetic number, because the mean of its divisors is an integer number (140890176).
Almost surely, 22004100423 is an apocalyptic number.
2004100423 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2004100423 is a deficient number, since it is larger than the sum of its proper divisors (250142393).
2004100423 is a wasteful number, since it uses less digits than its factorization.
2004100423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6414.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 2004100423 is about 44767.1801993380. The cubic root of 2004100423 is about 1260.7814970049.
Adding to 2004100423 its reverse (3240014002), we get a palindrome (5244114425).
The spelling of 2004100423 in words is "two billion, four million, one hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •