Base | Representation |
---|---|
bin | 1001111011011000111… |
… | …1011000011100011100 |
3 | 121022020201000012201001 |
4 | 2132312033120130130 |
5 | 10243302132211030 |
6 | 210204342400044 |
7 | 15215444236216 |
oct | 2366617303434 |
9 | 538221005631 |
10 | 170561210140 |
11 | 663753a1702 |
12 | 29080730024 |
13 | 131122c0ba9 |
14 | 83804035b6 |
15 | 4683c54cca |
hex | 27b63d871c |
170561210140 has 48 divisors (see below), whose sum is σ = 363191633280. Its totient is φ = 67271892480.
The previous prime is 170561210063. The next prime is 170561210159. The reversal of 170561210140 is 41012165071.
It is a super-2 number, since 2×1705612101402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 170561210099 and 170561210108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1131454 + ... + 1273306.
It is an arithmetic number, because the mean of its divisors is an integer number (7566492360).
Almost surely, 2170561210140 is an apocalyptic number.
170561210140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
170561210140 is an abundant number, since it is smaller than the sum of its proper divisors (192630423140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
170561210140 is a wasteful number, since it uses less digits than its factorization.
170561210140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142702 (or 142700 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 28.
The spelling of 170561210140 in words is "one hundred seventy billion, five hundred sixty-one million, two hundred ten thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •