Base | Representation |
---|---|
bin | 1110111111001010… |
… | …0100100001010011 |
3 | 101101101000011011122 |
4 | 3233302210201103 |
5 | 31214342331121 |
6 | 1503111032455 |
7 | 201460014146 |
oct | 35762444123 |
9 | 11341004148 |
10 | 4023011411 |
11 | 1784981021 |
12 | 94336b72b |
13 | 4c161a733 |
14 | 2a242405d |
15 | 1882bd5ab |
hex | efca4853 |
4023011411 has 8 divisors (see below), whose sum is σ = 4073391504. Its totient is φ = 3972676960.
The previous prime is 4023011407. The next prime is 4023011413. The reversal of 4023011411 is 1141103204.
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 4023011411 - 22 = 4023011407 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 4023011411.
It is not an unprimeable number, because it can be changed into a prime (4023011413) 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 7 ways as a sum of consecutive naturals, for example, 187445 + ... + 207801.
It is an arithmetic number, because the mean of its divisors is an integer number (509173938).
Almost surely, 24023011411 is an apocalyptic number.
4023011411 is a deficient number, since it is larger than the sum of its proper divisors (50380093).
4023011411 is a wasteful number, since it uses less digits than its factorization.
4023011411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22821.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 4023011411 is about 63427.2134891641. The cubic root of 4023011411 is about 1590.4392614402.
Adding to 4023011411 its reverse (1141103204), we get a palindrome (5164114615).
The spelling of 4023011411 in words is "four billion, twenty-three million, eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •