Base | Representation |
---|---|
bin | 1111011110101000… |
… | …0110000110111101 |
3 | 101201120101020122202 |
4 | 3313222012012331 |
5 | 32002140214141 |
6 | 1524144121245 |
7 | 204651660155 |
oct | 36752060675 |
9 | 11646336582 |
10 | 4155007421 |
11 | 1842436634 |
12 | 97b606225 |
13 | 512a84896 |
14 | 2b5b83765 |
15 | 194b9349b |
hex | f7a861bd |
4155007421 has 2 divisors, whose sum is σ = 4155007422. Its totient is φ = 4155007420.
The previous prime is 4155007403. The next prime is 4155007433. The reversal of 4155007421 is 1247005514.
4155007421 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2958816025 + 1196191396 = 54395^2 + 34586^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4155007421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4155027421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2077503710 + 2077503711.
It is an arithmetic number, because the mean of its divisors is an integer number (2077503711).
Almost surely, 24155007421 is an apocalyptic number.
It is an amenable number.
4155007421 is a deficient number, since it is larger than the sum of its proper divisors (1).
4155007421 is an equidigital number, since it uses as much as digits as its factorization.
4155007421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5600, while the sum is 29.
The square root of 4155007421 is about 64459.3470413717. The cubic root of 4155007421 is about 1607.6466551410.
The spelling of 4155007421 in words is "four billion, one hundred fifty-five million, seven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •