Base | Representation |
---|---|
bin | 1111110110011110… |
… | …1010000010011101 |
3 | 101222112120222211112 |
4 | 3331213222002131 |
5 | 32203242001303 |
6 | 1542120031405 |
7 | 210305112341 |
oct | 37547520235 |
9 | 11875528745 |
10 | 4255031453 |
11 | 1893944122 |
12 | 9a9002565 |
13 | 52a7062ba |
14 | 2c517d621 |
15 | 19d8500d8 |
hex | fd9ea09d |
4255031453 has 2 divisors, whose sum is σ = 4255031454. Its totient is φ = 4255031452.
The previous prime is 4255031419. The next prime is 4255031461. The reversal of 4255031453 is 3541305524.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2244674884 + 2010356569 = 47378^2 + 44837^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4255031453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4255031483) 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, 2127515726 + 2127515727.
It is an arithmetic number, because the mean of its divisors is an integer number (2127515727).
Almost surely, 24255031453 is an apocalyptic number.
It is an amenable number.
4255031453 is a deficient number, since it is larger than the sum of its proper divisors (1).
4255031453 is an equidigital number, since it uses as much as digits as its factorization.
4255031453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 32.
The square root of 4255031453 is about 65230.6021204772. The cubic root of 4255031453 is about 1620.4448624581. Note that the first 3 decimals are identical.
Adding to 4255031453 its reverse (3541305524), we get a palindrome (7796336977).
The spelling of 4255031453 in words is "four billion, two hundred fifty-five million, thirty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •