Base | Representation |
---|---|
bin | 100001111111101… |
… | …0010110000010001 |
3 | 2221111100210201020 |
4 | 1003333102300101 |
5 | 4314002242421 |
6 | 305104230053 |
7 | 40160331663 |
oct | 10377226021 |
9 | 2844323636 |
10 | 1140665361 |
11 | 53596a850 |
12 | 27a00b329 |
13 | 15241b324 |
14 | ab6c6533 |
15 | 6a219dc6 |
hex | 43fd2c11 |
1140665361 has 32 divisors (see below), whose sum is σ = 1757345280. Its totient is φ = 650851200.
The previous prime is 1140665353. The next prime is 1140665377. The reversal of 1140665361 is 1635660411.
It is not a de Polignac number, because 1140665361 - 23 = 1140665353 is a prime.
It is a super-2 number, since 2×11406653612 = 2602234931570520642, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (1140665321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96621 + ... + 107781.
It is an arithmetic number, because the mean of its divisors is an integer number (54917040).
Almost surely, 21140665361 is an apocalyptic number.
1140665361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1140665361 is a deficient number, since it is larger than the sum of its proper divisors (616679919).
1140665361 is a wasteful number, since it uses less digits than its factorization.
1140665361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11357.
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 1140665361 is about 33773.7377410319. The cubic root of 1140665361 is about 1044.8471227716.
It can be divided in two parts, 11406 and 65361, that added together give a palindrome (76767).
The spelling of 1140665361 in words is "one billion, one hundred forty million, six hundred sixty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •