Base | Representation |
---|---|
bin | 1100000101010100… |
… | …1001001010100101 |
3 | 22101001022011121200 |
4 | 3001111021022211 |
5 | 23120321422003 |
6 | 1253504233113 |
7 | 143243452104 |
oct | 30125111245 |
9 | 8331264550 |
10 | 3243545253 |
11 | 1414995613 |
12 | 76630b799 |
13 | 3c8ca6c60 |
14 | 22aac203b |
15 | 13eb506a3 |
hex | c15492a5 |
3243545253 has 48 divisors (see below), whose sum is σ = 5143472880. Its totient is φ = 1957478400.
The previous prime is 3243545213. The next prime is 3243545257. The reversal of 3243545253 is 3525453423.
It can be written as a sum of positive squares in 8 ways, for example, as 662702049 + 2580843204 = 25743^2 + 50802^2 .
It is not a de Polignac number, because 3243545253 - 26 = 3243545189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3243545257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4574463 + ... + 4575171.
It is an arithmetic number, because the mean of its divisors is an integer number (107155685).
Almost surely, 23243545253 is an apocalyptic number.
It is an amenable number.
3243545253 is a deficient number, since it is larger than the sum of its proper divisors (1899927627).
3243545253 is a wasteful number, since it uses less digits than its factorization.
3243545253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1430 (or 1427 counting only the distinct ones).
The product of its digits is 216000, while the sum is 36.
The square root of 3243545253 is about 56952.1312419474. The cubic root of 3243545253 is about 1480.2667605651.
Adding to 3243545253 its reverse (3525453423), we get a palindrome (6768998676).
The spelling of 3243545253 in words is "three billion, two hundred forty-three million, five hundred forty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •