Base | Representation |
---|---|
bin | 10100010001100… |
… | …00100010111001 |
3 | 102212000100122111 |
4 | 22020300202321 |
5 | 322014140103 |
6 | 24513052321 |
7 | 4133361343 |
oct | 1210604271 |
9 | 385010574 |
10 | 170068153 |
11 | 87aa97a2 |
12 | 48b570a1 |
13 | 29307358 |
14 | 18830293 |
15 | ede586d |
hex | a2308b9 |
170068153 has 8 divisors (see below), whose sum is σ = 181283400. Its totient is φ = 158987520.
The previous prime is 170068127. The next prime is 170068159. The reversal of 170068153 is 351860071.
It can be written as a sum of positive squares in 4 ways, for example, as 44448889 + 125619264 = 6667^2 + 11208^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-170068153 is a prime.
It is a super-3 number, since 3×1700681533 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (170068159) 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, 31038 + ... + 36103.
It is an arithmetic number, because the mean of its divisors is an integer number (22660425).
Almost surely, 2170068153 is an apocalyptic number.
It is an amenable number.
170068153 is a deficient number, since it is larger than the sum of its proper divisors (11215247).
170068153 is a wasteful number, since it uses less digits than its factorization.
170068153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67307.
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 170068153 is about 13041.0180967592. The cubic root of 170068153 is about 554.0398440848.
The spelling of 170068153 in words is "one hundred seventy million, sixty-eight thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •