Base | Representation |
---|---|
bin | 10010001110011011111… |
… | …111001000001010000101 |
3 | 11102201210120100012021101 |
4 | 102032123333020022011 |
5 | 131010010320000401 |
6 | 2355211351420101 |
7 | 156325640411605 |
oct | 22163377101205 |
9 | 4381716305241 |
10 | 1252452500101 |
11 | 44318686a830 |
12 | 182897984631 |
13 | 9114b49570a |
14 | 44894862c05 |
15 | 228a4a27101 |
hex | 1239bfc8285 |
1252452500101 has 8 divisors (see below), whose sum is σ = 1366658030304. Its totient is φ = 1138304671920.
The previous prime is 1252452499999. The next prime is 1252452500111. The reversal of 1252452500101 is 1010052542521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1252452500101 - 29 = 1252452499589 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1252452500101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1252452500111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14380110 + ... + 14466943.
It is an arithmetic number, because the mean of its divisors is an integer number (170832253788).
Almost surely, 21252452500101 is an apocalyptic number.
1252452500101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1252452500101 is a deficient number, since it is larger than the sum of its proper divisors (114205530203).
1252452500101 is a wasteful number, since it uses less digits than its factorization.
1252452500101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28851011.
The product of its (nonzero) digits is 4000, while the sum is 28.
The spelling of 1252452500101 in words is "one trillion, two hundred fifty-two billion, four hundred fifty-two million, five hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •