Base | Representation |
---|---|
bin | 100001111110100… |
… | …1101110111000001 |
3 | 2221110100011000122 |
4 | 1003331031313001 |
5 | 4313332333100 |
6 | 305044430025 |
7 | 40152604001 |
oct | 10375156701 |
9 | 2843304018 |
10 | 1140121025 |
11 | 53562888a |
12 | 2799a8315 |
13 | 15228a634 |
14 | ab5c4001 |
15 | 6a15d985 |
hex | 43f4ddc1 |
1140121025 has 12 divisors (see below), whose sum is σ = 1428327852. Its totient is φ = 902691840.
The previous prime is 1140121013. The next prime is 1140121033. The reversal of 1140121025 is 5201210411.
It can be written as a sum of positive squares in 6 ways, for example, as 72726784 + 1067394241 = 8528^2 + 32671^2 .
It is not a de Polignac number, because 1140121025 - 24 = 1140121009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1140120994 and 1140121012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 232652 + ... + 237501.
It is an arithmetic number, because the mean of its divisors is an integer number (119027321).
Almost surely, 21140121025 is an apocalyptic number.
It is an amenable number.
1140121025 is a deficient number, since it is larger than the sum of its proper divisors (288206827).
1140121025 is an equidigital number, since it uses as much as digits as its factorization.
1140121025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470260 (or 470255 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 1140121025 is about 33765.6782102774. The cubic root of 1140121025 is about 1044.6808927748.
Adding to 1140121025 its reverse (5201210411), we get a palindrome (6341331436).
The spelling of 1140121025 in words is "one billion, one hundred forty million, one hundred twenty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •