Base | Representation |
---|---|
bin | 10100000110111… |
… | …01100000111001 |
3 | 102202101210202012 |
4 | 22003131200321 |
5 | 321140220411 |
6 | 24423215305 |
7 | 4115515625 |
oct | 1203354071 |
9 | 382353665 |
10 | 168679481 |
11 | 87240433 |
12 | 485a7535 |
13 | 28c3c259 |
14 | 1858c185 |
15 | ec1e18b |
hex | a0dd839 |
168679481 has 6 divisors (see below), whose sum is σ = 169300782. Its totient is φ = 168059840.
The previous prime is 168679429. The next prime is 168679487. The reversal of 168679481 is 184976861.
It can be written as a sum of positive squares in 3 ways, for example, as 1210000 + 167469481 = 1100^2 + 12941^2 .
It is not a de Polignac number, because 168679481 - 26 = 168679417 is a prime.
It is a super-2 number, since 2×1686794812 = 56905534620858722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (168679487) 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 5 ways as a sum of consecutive naturals, for example, 296165 + ... + 296733.
It is an arithmetic number, because the mean of its divisors is an integer number (28216797).
Almost surely, 2168679481 is an apocalyptic number.
It is an amenable number.
168679481 is a deficient number, since it is larger than the sum of its proper divisors (621301).
168679481 is an frugal number, since it uses more digits than its factorization.
168679481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1659 (or 1090 counting only the distinct ones).
The product of its digits is 580608, while the sum is 50.
The square root of 168679481 is about 12987.6664955642. Note that the first 3 decimals coincide. The cubic root of 168679481 is about 552.5277380067.
The spelling of 168679481 in words is "one hundred sixty-eight million, six hundred seventy-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •