Base | Representation |
---|---|
bin | 10010001110111101010… |
… | …110011000011010011101 |
3 | 11102210020120121010201112 |
4 | 102032331112120122131 |
5 | 131012132113303000 |
6 | 2355343104551405 |
7 | 156345545225435 |
oct | 22167526303235 |
9 | 4383216533645 |
10 | 1253012244125 |
11 | 4434438227a4 |
12 | 182a13322565 |
13 | 9120a4380b5 |
14 | 44908d2b2c5 |
15 | 228d8c42235 |
hex | 123bd59869d |
1253012244125 has 8 divisors (see below), whose sum is σ = 1563759280824. Its totient is φ = 1002409795200.
The previous prime is 1253012244091. The next prime is 1253012244139. The reversal of 1253012244125 is 5214422103521.
It can be written as a sum of positive squares in 4 ways, for example, as 2189210521 + 1250823033604 = 46789^2 + 1118402^2 .
It is not a de Polignac number, because 1253012244125 - 26 = 1253012244061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1253012244091 and 1253012244100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5012048852 + ... + 5012049101.
It is an arithmetic number, because the mean of its divisors is an integer number (195469910103).
Almost surely, 21253012244125 is an apocalyptic number.
It is an amenable number.
1253012244125 is a deficient number, since it is larger than the sum of its proper divisors (310747036699).
1253012244125 is an equidigital number, since it uses as much as digits as its factorization.
1253012244125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10024097968 (or 10024097958 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 1253012244125 its reverse (5214422103521), we get a palindrome (6467434347646).
The spelling of 1253012244125 in words is "one trillion, two hundred fifty-three billion, twelve million, two hundred forty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •