Base | Representation |
---|---|
bin | 1110111110100011… |
… | …0011101110011101 |
3 | 101101012012010200000 |
4 | 3233220303232131 |
5 | 31213213433003 |
6 | 1502540124513 |
7 | 201426165066 |
oct | 35750635635 |
9 | 11335163600 |
10 | 4020452253 |
11 | 1783493314 |
12 | 942536739 |
13 | 4c0c3293c |
14 | 2a1d5956d |
15 | 187e651a3 |
hex | efa33b9d |
4020452253 has 12 divisors (see below), whose sum is σ = 6022406208. Its totient is φ = 2680301340.
The previous prime is 4020452209. The next prime is 4020452257. The reversal of 4020452253 is 3522540204.
It is a happy number.
4020452253 is a `hidden beast` number, since 402 + 0 + 4 + 5 + 2 + 253 = 666.
It is not a de Polignac number, because 4020452253 - 29 = 4020451741 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4020452257) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8272293 + ... + 8272778.
It is an arithmetic number, because the mean of its divisors is an integer number (501867184).
Almost surely, 24020452253 is an apocalyptic number.
It is an amenable number.
4020452253 is a deficient number, since it is larger than the sum of its proper divisors (2001953955).
4020452253 is an equidigital number, since it uses as much as digits as its factorization.
4020452253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16545086 (or 16545074 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 27.
The square root of 4020452253 is about 63407.0363051294. The cubic root of 4020452253 is about 1590.1019478953.
Adding to 4020452253 its reverse (3522540204), we get a palindrome (7542992457).
The spelling of 4020452253 in words is "four billion, twenty million, four hundred fifty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •