Base | Representation |
---|---|
bin | 1001010101101000011… |
… | …1000111110001010110 |
3 | 120100002100002011222122 |
4 | 2111122013013301112 |
5 | 10112022423344410 |
6 | 201410513255542 |
7 | 14406332103461 |
oct | 2253207076126 |
9 | 510070064878 |
10 | 160425606230 |
11 | 6204408844a |
12 | 271122645b2 |
13 | 121884a5326 |
14 | 7a9c2622d8 |
15 | 428e00ce55 |
hex | 255a1c7c56 |
160425606230 has 32 divisors (see below), whose sum is σ = 290693523168. Its totient is φ = 63743097600.
The previous prime is 160425606227. The next prime is 160425606233. The reversal of 160425606230 is 32606524061.
It is a happy number.
160425606230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (160425606227) and next prime (160425606233).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160425606233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1026344 + ... + 1172276.
It is an arithmetic number, because the mean of its divisors is an integer number (9084172599).
Almost surely, 2160425606230 is an apocalyptic number.
160425606230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
160425606230 is a deficient number, since it is larger than the sum of its proper divisors (130267916938).
160425606230 is a wasteful number, since it uses less digits than its factorization.
160425606230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146672.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 160425606230 in words is "one hundred sixty billion, four hundred twenty-five million, six hundred six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •