Base | Representation |
---|---|
bin | 100010110001001… |
… | …1110001011100101 |
3 | 10000022021200201101 |
4 | 1011202132023211 |
5 | 4342131230141 |
6 | 311433400101 |
7 | 40624324666 |
oct | 10542361345 |
9 | 3008250641 |
10 | 1166664421 |
11 | 54960827a |
12 | 286869031 |
13 | 1579221a0 |
14 | b0d3336d |
15 | 6c653531 |
hex | 4589e2e5 |
1166664421 has 8 divisors (see below), whose sum is σ = 1270526040. Its totient is φ = 1064819712.
The previous prime is 1166664419. The next prime is 1166664431. The reversal of 1166664421 is 1244666611.
It can be written as a sum of positive squares in 4 ways, for example, as 42068196 + 1124596225 = 6486^2 + 33535^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1166664421 - 21 = 1166664419 is a prime.
It is a super-2 number, since 2×11666644212 = 2722211742454530482, 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 (1166664431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 503020 + ... + 505333.
It is an arithmetic number, because the mean of its divisors is an integer number (158815755).
Almost surely, 21166664421 is an apocalyptic number.
It is an amenable number.
1166664421 is a deficient number, since it is larger than the sum of its proper divisors (103861619).
1166664421 is a wasteful number, since it uses less digits than its factorization.
1166664421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008455.
The product of its digits is 41472, while the sum is 37.
The square root of 1166664421 is about 34156.4696799889. The cubic root of 1166664421 is about 1052.7259241595.
The spelling of 1166664421 in words is "one billion, one hundred sixty-six million, six hundred sixty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •