Base | Representation |
---|---|
bin | 1110111110101011… |
… | …1011111110010011 |
3 | 101101020020111012021 |
4 | 3233222323332103 |
5 | 31213334312243 |
6 | 1503000112311 |
7 | 201434011111 |
oct | 35752737623 |
9 | 11336214167 |
10 | 4021010323 |
11 | 1783834630 |
12 | 942765697 |
13 | 4c1099965 |
14 | 2a2062ab1 |
15 | 1880256ed |
hex | efabbf93 |
4021010323 has 8 divisors (see below), whose sum is σ = 4644589680. Its totient is φ = 3440436480.
The previous prime is 4021010321. The next prime is 4021010339. The reversal of 4021010323 is 3230101204.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4021010323 - 21 = 4021010321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4021010297 and 4021010306.
It is not an unprimeable number, because it can be changed into a prime (4021010321) 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, 10751178 + ... + 10751551.
It is an arithmetic number, because the mean of its divisors is an integer number (580573710).
Almost surely, 24021010323 is an apocalyptic number.
4021010323 is a deficient number, since it is larger than the sum of its proper divisors (623579357).
4021010323 is a wasteful number, since it uses less digits than its factorization.
4021010323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21502757.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 4021010323 is about 63411.4368469916. The cubic root of 4021010323 is about 1590.1755173251.
Adding to 4021010323 its reverse (3230101204), we get a palindrome (7251111527).
The spelling of 4021010323 in words is "four billion, twenty-one million, ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •