Base | Representation |
---|---|
bin | 100001111110011… |
… | …0001101001001111 |
3 | 2221110010021111021 |
4 | 1003330301221033 |
5 | 4313320133310 |
6 | 305042135011 |
7 | 40151613031 |
oct | 10374615117 |
9 | 2843107437 |
10 | 1140005455 |
11 | 535559a76 |
12 | 279951467 |
13 | 152249b54 |
14 | ab593c51 |
15 | 6a1395da |
hex | 43f31a4f |
1140005455 has 8 divisors (see below), whose sum is σ = 1377067104. Its totient is φ = 905964000.
The previous prime is 1140005437. The next prime is 1140005459. The reversal of 1140005455 is 5545000411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1140005455 - 211 = 1140003407 is a prime.
It is a super-2 number, since 2×11400054552 = 2599224874859514050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140005459) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 754216 + ... + 755725.
It is an arithmetic number, because the mean of its divisors is an integer number (172133388).
Almost surely, 21140005455 is an apocalyptic number.
1140005455 is a deficient number, since it is larger than the sum of its proper divisors (237061649).
1140005455 is a wasteful number, since it uses less digits than its factorization.
1140005455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510097.
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 1140005455 is about 33763.9668137498. The cubic root of 1140005455 is about 1044.6455930573.
Adding to 1140005455 its reverse (5545000411), we get a palindrome (6685005866).
The spelling of 1140005455 in words is "one billion, one hundred forty million, five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •