Base | Representation |
---|---|
bin | 111011101110100… |
… | …1110100010010111 |
3 | 12011200011101112110 |
4 | 1313131032202113 |
5 | 13101030303143 |
6 | 530511522103 |
7 | 100443666102 |
oct | 16735164227 |
9 | 5150141473 |
10 | 2004150423 |
11 | 939321970 |
12 | 47b229333 |
13 | 25c29b532 |
14 | 150259739 |
15 | bae32533 |
hex | 7774e897 |
2004150423 has 16 divisors (see below), whose sum is σ = 2918232576. Its totient is φ = 1213343040.
The previous prime is 2004150391. The next prime is 2004150433. The reversal of 2004150423 is 3240514002.
It is not a de Polignac number, because 2004150423 - 25 = 2004150391 is a prime.
It is a super-2 number, since 2×20041504232 = 8033237836022157858, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2004150423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2004150433) 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 15 ways as a sum of consecutive naturals, for example, 415 + ... + 63312.
It is an arithmetic number, because the mean of its divisors is an integer number (182389536).
Almost surely, 22004150423 is an apocalyptic number.
2004150423 is a deficient number, since it is larger than the sum of its proper divisors (914082153).
2004150423 is a wasteful number, since it uses less digits than its factorization.
2004150423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64694.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 2004150423 is about 44767.7386406774. The cubic root of 2004150423 is about 1260.7919819336.
Adding to 2004150423 its reverse (3240514002), we get a palindrome (5244664425).
The spelling of 2004150423 in words is "two billion, four million, one hundred fifty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •