Base | Representation |
---|---|
bin | 100001111111101… |
… | …0010101011001010 |
3 | 2221111100210021010 |
4 | 1003333102223022 |
5 | 4314002240114 |
6 | 305104224350 |
7 | 40160331015 |
oct | 10377225312 |
9 | 2844323233 |
10 | 1140665034 |
11 | 53596a583 |
12 | 27a00b0b6 |
13 | 15241b132 |
14 | ab6c637c |
15 | 6a219c59 |
hex | 43fd2aca |
1140665034 has 8 divisors (see below), whose sum is σ = 2281330080. Its totient is φ = 380221676.
The previous prime is 1140665027. The next prime is 1140665039. The reversal of 1140665034 is 4305660411.
It is a sphenic number, since it is the product of 3 distinct primes.
1140665034 is an admirable number.
It is a super-2 number, since 2×11406650342 = 2602233439580442312, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1140664992 and 1140665010.
It is not an unprimeable number, because it can be changed into a prime (1140665039) 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 3 ways as a sum of consecutive naturals, for example, 95055414 + ... + 95055425.
It is an arithmetic number, because the mean of its divisors is an integer number (285166260).
Almost surely, 21140665034 is an apocalyptic number.
1140665034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140665034 is a wasteful number, since it uses less digits than its factorization.
1140665034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190110844.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 1140665034 is about 33773.7328999920. The cubic root of 1140665034 is about 1044.8470229279.
The spelling of 1140665034 in words is "one billion, one hundred forty million, six hundred sixty-five thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •