Base | Representation |
---|---|
bin | 10100001011111… |
… | …00110100000000 |
3 | 102210121221210101 |
4 | 22011330310000 |
5 | 321322110333 |
6 | 24445212144 |
7 | 4124204131 |
oct | 1205746400 |
9 | 383557711 |
10 | 169331968 |
11 | 87646683 |
12 | 48861054 |
13 | 2910a240 |
14 | 186bbc88 |
15 | ecec67d |
hex | a17cd00 |
169331968 has 144 divisors (see below), whose sum is σ = 400223376. Its totient is φ = 70778880.
The previous prime is 169331891. The next prime is 169331983. The reversal of 169331968 is 869133961.
It can be written as a sum of positive squares in 8 ways, for example, as 14379264 + 154952704 = 3792^2 + 12448^2 .
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2319580 + ... + 2319652.
It is an arithmetic number, because the mean of its divisors is an integer number (2779329).
Almost surely, 2169331968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 169331968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200111688).
169331968 is an abundant number, since it is smaller than the sum of its proper divisors (230891408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
169331968 is a wasteful number, since it uses less digits than its factorization.
169331968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160 (or 146 counting only the distinct ones).
The product of its digits is 209952, while the sum is 46.
The square root of 169331968 is about 13012.7617360805. The cubic root of 169331968 is about 553.2392517582.
The spelling of 169331968 in words is "one hundred sixty-nine million, three hundred thirty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •