Base | Representation |
---|---|
bin | 1111000100000000… |
… | …0010110010000011 |
3 | 101102210012221221022 |
4 | 3301000002302003 |
5 | 31240042223301 |
6 | 1505114220055 |
7 | 202124441162 |
oct | 36100026203 |
9 | 11383187838 |
10 | 4043320451 |
11 | 1795392555 |
12 | 94a12462b |
13 | 4c58ab711 |
14 | 2a4dcd3d9 |
15 | 189e80d1b |
hex | f1002c83 |
4043320451 has 2 divisors, whose sum is σ = 4043320452. Its totient is φ = 4043320450.
The previous prime is 4043320399. The next prime is 4043320453. The reversal of 4043320451 is 1540233404.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4043320451 is a prime.
Together with 4043320453, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4043320451.
It is not a weakly prime, because it can be changed into another prime (4043320453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2021660225 + 2021660226.
It is an arithmetic number, because the mean of its divisors is an integer number (2021660226).
Almost surely, 24043320451 is an apocalyptic number.
4043320451 is a deficient number, since it is larger than the sum of its proper divisors (1).
4043320451 is an equidigital number, since it uses as much as digits as its factorization.
4043320451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 26.
The square root of 4043320451 is about 63587.1091574385. The cubic root of 4043320451 is about 1593.1110654057. Note that the first 3 decimals are identical.
Adding to 4043320451 its reverse (1540233404), we get a palindrome (5583553855).
The spelling of 4043320451 in words is "four billion, forty-three million, three hundred twenty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •