Base | Representation |
---|---|
bin | 10010100011011011111… |
… | …011000000111001111101 |
3 | 11111212222221102212120212 |
4 | 102203123323000321331 |
5 | 131342200000001000 |
6 | 2413421002522205 |
7 | 161054455120355 |
oct | 22433373007175 |
9 | 4455887385525 |
10 | 1275000000125 |
11 | 4517a7296275 |
12 | 18712ab06365 |
13 | 93302890cc7 |
14 | 459d3201b65 |
15 | 23274252c35 |
hex | 128dbec0e7d |
1275000000125 has 16 divisors (see below), whose sum is σ = 1591368090624. Its totient is φ = 1019892250000.
The previous prime is 1275000000101. The next prime is 1275000000137. The reversal of 1275000000125 is 5210000005721.
It is a happy number.
It is not a de Polignac number, because 1275000000125 - 228 = 1274731564669 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 1275000000125.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 659900 + ... + 1727850.
It is an arithmetic number, because the mean of its divisors is an integer number (99460505664).
Almost surely, 21275000000125 is an apocalyptic number.
It is an amenable number.
1275000000125 is a deficient number, since it is larger than the sum of its proper divisors (316368090499).
1275000000125 is an equidigital number, since it uses as much as digits as its factorization.
1275000000125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1077517 (or 1077507 counting only the distinct ones).
The product of its (nonzero) digits is 700, while the sum is 23.
Adding to 1275000000125 its reverse (5210000005721), we get a palindrome (6485000005846).
The spelling of 1275000000125 in words is "one trillion, two hundred seventy-five billion, one hundred twenty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •