Base | Representation |
---|---|
bin | 100101010100001… |
… | …1011011111110111 |
3 | 10020021001220021102 |
4 | 1022220123133313 |
5 | 10031020044000 |
6 | 324125040315 |
7 | 43012531253 |
oct | 11250333767 |
9 | 3207056242 |
10 | 1252112375 |
11 | 59286a618 |
12 | 2ab3b609b |
13 | 16c53c1c7 |
14 | bc417263 |
15 | 74dd13d5 |
hex | 4aa1b7f7 |
1252112375 has 32 divisors (see below), whose sum is σ = 1621995648. Its totient is φ = 964224000.
The previous prime is 1252112363. The next prime is 1252112377. The reversal of 1252112375 is 5732112521.
1252112375 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1252112375 - 28 = 1252112119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1252112377) 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 31 ways as a sum of consecutive naturals, for example, 447230 + ... + 450020.
It is an arithmetic number, because the mean of its divisors is an integer number (50687364).
Almost surely, 21252112375 is an apocalyptic number.
1252112375 is a deficient number, since it is larger than the sum of its proper divisors (369883273).
1252112375 is an equidigital number, since it uses as much as digits as its factorization.
1252112375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2940 (or 2930 counting only the distinct ones).
The product of its digits is 4200, while the sum is 29.
The square root of 1252112375 is about 35385.1999429140. The cubic root of 1252112375 is about 1077.8238000584.
Adding to 1252112375 its reverse (5732112521), we get a palindrome (6984224896).
The spelling of 1252112375 in words is "one billion, two hundred fifty-two million, one hundred twelve thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •