Base | Representation |
---|---|
bin | 111111111000000… |
… | …100110011101001 |
3 | 2202200112012010122 |
4 | 333320010303221 |
5 | 4143321224421 |
6 | 254201253025 |
7 | 35361665615 |
oct | 7770046351 |
9 | 2680465118 |
10 | 1071664361 |
11 | 4aaa21329 |
12 | 25aa94175 |
13 | 14103c431 |
14 | a2484345 |
15 | 6413a2ab |
hex | 3fe04ce9 |
1071664361 has 4 divisors (see below), whose sum is σ = 1096586832. Its totient is φ = 1046741892.
The previous prime is 1071664357. The next prime is 1071664367. The reversal of 1071664361 is 1634661701.
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 1071664361 - 22 = 1071664357 is a prime.
It is a super-2 number, since 2×10716643612 = 2296929005275076642, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1071664367) 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, 12461171 + ... + 12461256.
It is an arithmetic number, because the mean of its divisors is an integer number (274146708).
Almost surely, 21071664361 is an apocalyptic number.
It is an amenable number.
1071664361 is a deficient number, since it is larger than the sum of its proper divisors (24922471).
1071664361 is an equidigital number, since it uses as much as digits as its factorization.
1071664361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24922470.
The product of its (nonzero) digits is 18144, while the sum is 35.
The square root of 1071664361 is about 32736.2850824586. The cubic root of 1071664361 is about 1023.3391659231.
The spelling of 1071664361 in words is "one billion, seventy-one million, six hundred sixty-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •