Base | Representation |
---|---|
bin | 1000000100111010… |
… | …0110001000011011 |
3 | 12121002122020100000 |
4 | 2001032212020123 |
5 | 13420012241232 |
6 | 555045344043 |
7 | 104504302356 |
oct | 20116461033 |
9 | 5532566300 |
10 | 2168087067 |
11 | a129129a3 |
12 | 506108023 |
13 | 287239a73 |
14 | 167d3129d |
15 | ca51627c |
hex | 813a621b |
2168087067 has 54 divisors (see below), whose sum is σ = 3396492372. Its totient is φ = 1382001264.
The previous prime is 2168087057. The next prime is 2168087123. The reversal of 2168087067 is 7607808612.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 2168087067 - 26 = 2168087003 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (2168087057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 21049338 + ... + 21049440.
Almost surely, 22168087067 is an apocalyptic number.
2168087067 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
2168087067 is a deficient number, since it is larger than the sum of its proper divisors (1228405305).
2168087067 is an frugal number, since it uses more digits than its factorization.
2168087067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279 (or 135 counting only the distinct ones).
The product of its (nonzero) digits is 225792, while the sum is 45.
The square root of 2168087067 is about 46562.7218598741. The cubic root of 2168087067 is about 1294.2720509406.
The spelling of 2168087067 in words is "two billion, one hundred sixty-eight million, eighty-seven thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •