Base | Representation |
---|---|
bin | 10100000010010… |
… | …01101010001101 |
3 | 102201021001000010 |
4 | 22001021222031 |
5 | 321011330434 |
6 | 24402223433 |
7 | 4110414165 |
oct | 1201115215 |
9 | 381231003 |
10 | 168073869 |
11 | 86967427 |
12 | 48354b79 |
13 | 28a896c2 |
14 | 184715a5 |
15 | eb4e9e9 |
hex | a049a8d |
168073869 has 8 divisors (see below), whose sum is σ = 230155360. Its totient is φ = 109020816.
The previous prime is 168073861. The next prime is 168073877. The reversal of 168073869 is 968370861.
It is an interprime number because it is at equal distance from previous prime (168073861) and next prime (168073877).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 168073869 - 23 = 168073861 is a prime.
It is a super-2 number, since 2×1680738692 = 56497650881258322, 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 (168073861) 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 7 ways as a sum of consecutive naturals, for example, 756979 + ... + 757200.
It is an arithmetic number, because the mean of its divisors is an integer number (28769420).
Almost surely, 2168073869 is an apocalyptic number.
It is an amenable number.
168073869 is a deficient number, since it is larger than the sum of its proper divisors (62081491).
168073869 is a wasteful number, since it uses less digits than its factorization.
168073869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514219.
The product of its (nonzero) digits is 435456, while the sum is 48.
The square root of 168073869 is about 12964.3306421890. The cubic root of 168073869 is about 551.8656960331.
The spelling of 168073869 in words is "one hundred sixty-eight million, seventy-three thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •