Base | Representation |
---|---|
bin | 10010001110010100011… |
… | …001101101100010110010 |
3 | 11102201110200220021122222 |
4 | 102032110121231202302 |
5 | 131004230231020000 |
6 | 2355151004201042 |
7 | 156322533666653 |
oct | 22162431554262 |
9 | 4381420807588 |
10 | 1252325251250 |
11 | 443120a57897 |
12 | 182861239182 |
13 | 9112b001238 |
14 | 448819bb52a |
15 | 2289878da85 |
hex | 1239466d8b2 |
1252325251250 has 160 divisors (see below), whose sum is σ = 2585988218880. Its totient is φ = 452632320000.
The previous prime is 1252325251169. The next prime is 1252325251253. The reversal of 1252325251250 is 521525232521.
It is a self number, because there is not a number n which added to its sum of digits gives 1252325251250.
It is not an unprimeable number, because it can be changed into a prime (1252325251253) 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 in 79 ways as a sum of consecutive naturals, for example, 83653766 + ... + 83668734.
It is an arithmetic number, because the mean of its divisors is an integer number (16162426368).
Almost surely, 21252325251250 is an apocalyptic number.
1252325251250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1252325251250 is an abundant number, since it is smaller than the sum of its proper divisors (1333662967630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1252325251250 is a wasteful number, since it uses less digits than its factorization.
1252325251250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15166 (or 15151 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 1252325251250 in words is "one trillion, two hundred fifty-two billion, three hundred twenty-five million, two hundred fifty-one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •