Base | Representation |
---|---|
bin | 1001011000100111000… |
… | …1110000100100111010 |
3 | 120102011001212110211222 |
4 | 2112021301300210322 |
5 | 10120142140000240 |
6 | 202022121552042 |
7 | 14435212355030 |
oct | 2261161604472 |
9 | 512131773758 |
10 | 161225312570 |
11 | 62414538683 |
12 | 272b6045622 |
13 | 1228508464a |
14 | 7b36552550 |
15 | 42d9327eb5 |
hex | 2589c7093a |
161225312570 has 16 divisors (see below), whose sum is σ = 331663500288. Its totient is φ = 55277250000.
The previous prime is 161225312557. The next prime is 161225312627. The reversal of 161225312570 is 75213522161.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 161225312570.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1151609306 + ... + 1151609445.
It is an arithmetic number, because the mean of its divisors is an integer number (20728968768).
Almost surely, 2161225312570 is an apocalyptic number.
161225312570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
161225312570 is an abundant number, since it is smaller than the sum of its proper divisors (170438187718).
161225312570 is a wasteful number, since it uses less digits than its factorization.
161225312570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2303218765.
The product of its (nonzero) digits is 25200, while the sum is 35.
The spelling of 161225312570 in words is "one hundred sixty-one billion, two hundred twenty-five million, three hundred twelve thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •