Base | Representation |
---|---|
bin | 100001111110011… |
… | …0110010001010001 |
3 | 2221110011020110222 |
4 | 1003330312101101 |
5 | 4313321240101 |
6 | 305042402425 |
7 | 40152022205 |
oct | 10374662121 |
9 | 2843136428 |
10 | 1140024401 |
11 | 53557222a |
12 | 279960415 |
13 | 152255669 |
14 | ab59ab05 |
15 | 6a14001b |
hex | 43f36451 |
1140024401 has 4 divisors (see below), whose sum is σ = 1141059072. Its totient is φ = 1138989732.
The previous prime is 1140024359. The next prime is 1140024409. The reversal of 1140024401 is 1044200411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1140024401 - 210 = 1140023377 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1140024401.
It is not an unprimeable number, because it can be changed into a prime (1140024409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 515681 + ... + 517886.
It is an arithmetic number, because the mean of its divisors is an integer number (285264768).
Almost surely, 21140024401 is an apocalyptic number.
It is an amenable number.
1140024401 is a deficient number, since it is larger than the sum of its proper divisors (1034671).
1140024401 is a wasteful number, since it uses less digits than its factorization.
1140024401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034670.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 1140024401 is about 33764.2473779588. The cubic root of 1140024401 is about 1044.6513800897.
Adding to 1140024401 its reverse (1044200411), we get a palindrome (2184224812).
The spelling of 1140024401 in words is "one billion, one hundred forty million, twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •