Base | Representation |
---|---|
bin | 1110101100101110101… |
… | …1011001000110001000 |
3 | 220010210220211000000011 |
4 | 3223023223121012020 |
5 | 13114132431044000 |
6 | 312001500321304 |
7 | 24146545143256 |
oct | 3531353310610 |
9 | 803726730004 |
10 | 252525253000 |
11 | 98105a161a9 |
12 | 40b36243234 |
13 | 1aa752c0737 |
14 | c317d575d6 |
15 | 687e8822ba |
hex | 3acbad9188 |
252525253000 has 64 divisors (see below), whose sum is σ = 593971251120. Its totient is φ = 100486656000.
The previous prime is 252525252979. The next prime is 252525253049. The reversal of 252525253000 is 352525252.
252525253000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 4001068516 + 248524184484 = 63254^2 + 498522^2 .
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 461211 + ... + 847210.
Almost surely, 2252525253000 is an apocalyptic number.
252525253000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
252525253000 is an abundant number, since it is smaller than the sum of its proper divisors (341445998120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252525253000 is a wasteful number, since it uses less digits than its factorization.
252525253000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1308635 (or 1308621 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 31.
Adding to 252525253000 its reverse (352525252), we get a palindrome (252877778252).
The spelling of 252525253000 in words is "two hundred fifty-two billion, five hundred twenty-five million, two hundred fifty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •