Base | Representation |
---|---|
bin | 1110111111010000… |
… | …0110001011101001 |
3 | 101101101202110220021 |
4 | 3233310012023221 |
5 | 31214443131213 |
6 | 1503123400441 |
7 | 201463301326 |
oct | 35764061351 |
9 | 11341673807 |
10 | 4023411433 |
11 | 1785124618 |
12 | 943523121 |
13 | 4c172a832 |
14 | 2a24c9b4d |
15 | 18834bd8d |
hex | efd062e9 |
4023411433 has 2 divisors, whose sum is σ = 4023411434. Its totient is φ = 4023411432.
The previous prime is 4023411421. The next prime is 4023411451. The reversal of 4023411433 is 3341143204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2374807824 + 1648603609 = 48732^2 + 40603^2 .
It is a cyclic number.
It is not a de Polignac number, because 4023411433 - 229 = 3486540521 is a prime.
It is a super-2 number, since 2×40234114332 = 32375679118390226978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4023411398 and 4023411407.
It is not a weakly prime, because it can be changed into another prime (4023411463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011705716 + 2011705717.
It is an arithmetic number, because the mean of its divisors is an integer number (2011705717).
Almost surely, 24023411433 is an apocalyptic number.
It is an amenable number.
4023411433 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023411433 is an equidigital number, since it uses as much as digits as its factorization.
4023411433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 4023411433 is about 63430.3668048672. The cubic root of 4023411433 is about 1590.4919739933.
Adding to 4023411433 its reverse (3341143204), we get a palindrome (7364554637).
The spelling of 4023411433 in words is "four billion, twenty-three million, four hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •