Base | Representation |
---|---|
bin | 111011110111001… |
… | …011111001110111 |
3 | 2120222210212100210 |
4 | 323313023321313 |
5 | 4024101304143 |
6 | 243354040503 |
7 | 33613412466 |
oct | 7367137167 |
9 | 2528725323 |
10 | 1004322423 |
11 | 475a06335 |
12 | 240419133 |
13 | 1300c1730 |
14 | 975549dd |
15 | 5d287033 |
hex | 3bdcbe77 |
1004322423 has 8 divisors (see below), whose sum is σ = 1442104048. Its totient is φ = 618044544.
The previous prime is 1004322421. The next prime is 1004322427. The reversal of 1004322423 is 3242234001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1004322423 - 21 = 1004322421 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1004322423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004322421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12875890 + ... + 12875967.
It is an arithmetic number, because the mean of its divisors is an integer number (180263006).
Almost surely, 21004322423 is an apocalyptic number.
1004322423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1004322423 is a deficient number, since it is larger than the sum of its proper divisors (437781625).
1004322423 is a wasteful number, since it uses less digits than its factorization.
1004322423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25751873.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 1004322423 is about 31691.0464169298. The cubic root of 1004322423 is about 1001.4387367106.
Adding to 1004322423 its reverse (3242234001), we get a palindrome (4246556424).
The spelling of 1004322423 in words is "one billion, four million, three hundred twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •