Base | Representation |
---|---|
bin | 1000000101000011… |
… | …0100111000010001 |
3 | 12121010201221101100 |
4 | 2001100310320101 |
5 | 13420134444021 |
6 | 555110055013 |
7 | 104512256124 |
oct | 20120647021 |
9 | 5533657340 |
10 | 2168671761 |
11 | a13182213 |
12 | 50634a469 |
13 | 2873b2c39 |
14 | 1680443bb |
15 | ca5ce626 |
hex | 81434e11 |
2168671761 has 45 divisors (see below), whose sum is σ = 3385238649. Its totient is φ = 1337834232.
The previous prime is 2168671711. The next prime is 2168671763. The reversal of 2168671761 is 1671768612.
The square root of 2168671761 is 46569.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 2168671761 - 215 = 2168638993 is a prime.
It is a super-2 number, since 2×21686717612 = 9406274413917682242, which contains 22 as substring.
Its product of digits (169344) is a multiple of the sum of its prime factors (168).
It is not an unprimeable number, because it can be changed into a prime (2168671763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 50434206 + ... + 50434248.
Almost surely, 22168671761 is an apocalyptic number.
2168671761 is the 46569-th square number.
2168671761 is the 23285-th centered octagonal number.
It is an amenable number.
2168671761 is a deficient number, since it is larger than the sum of its proper divisors (1216566888).
2168671761 is an frugal number, since it uses more digits than its factorization.
2168671761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168 (or 65 counting only the distinct ones).
The product of its digits is 169344, while the sum is 45.
The cubic root of 2168671761 is about 1294.3883877638.
The spelling of 2168671761 in words is "two billion, one hundred sixty-eight million, six hundred seventy-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •