Base | Representation |
---|---|
bin | 1110111011000110… |
… | …1011111011110111 |
3 | 101100012000000020010 |
4 | 3232301223323313 |
5 | 31201014034143 |
6 | 1501302311303 |
7 | 201162313233 |
oct | 35661537367 |
9 | 11305000203 |
10 | 4006002423 |
11 | 1776313a05 |
12 | 939728533 |
13 | 4bac43847 |
14 | 2a00775c3 |
15 | 186a5da33 |
hex | eec6bef7 |
4006002423 has 8 divisors (see below), whose sum is σ = 5375358448. Its totient is φ = 2653657344.
The previous prime is 4006002361. The next prime is 4006002449. The reversal of 4006002423 is 3242006004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4006002423 - 28 = 4006002167 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 4006002423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4006006423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4252186 + ... + 4253127.
It is an arithmetic number, because the mean of its divisors is an integer number (671919806).
Almost surely, 24006002423 is an apocalyptic number.
4006002423 is a deficient number, since it is larger than the sum of its proper divisors (1369356025).
4006002423 is a wasteful number, since it uses less digits than its factorization.
4006002423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8505473.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 4006002423 is about 63292.9887349302. The cubic root of 4006002423 is about 1588.1946761768.
Adding to 4006002423 its reverse (3242006004), we get a palindrome (7248008427).
The spelling of 4006002423 in words is "four billion, six million, two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •