Base | Representation |
---|---|
bin | 1001010100111000100… |
… | …1111011000011110001 |
3 | 120022120100122001011211 |
4 | 2111032021323003301 |
5 | 10111120100422001 |
6 | 201334550040121 |
7 | 14401345101463 |
oct | 2251611730361 |
9 | 508510561154 |
10 | 160225014001 |
11 | 61a50930548 |
12 | 27077049041 |
13 | 12155a715c0 |
14 | 7a7d768133 |
15 | 427b5d8351 |
hex | 254e27b0f1 |
160225014001 has 16 divisors (see below), whose sum is σ = 173063374848. Its totient is φ = 147460420800.
The previous prime is 160225013999. The next prime is 160225014023. The reversal of 160225014001 is 100410522061.
160225014001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 160225014001 - 21 = 160225013999 is a prime.
It is a super-2 number, since 2×1602250140012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (160225114001) 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, 10232160 + ... + 10247806.
It is an arithmetic number, because the mean of its divisors is an integer number (10816460928).
Almost surely, 2160225014001 is an apocalyptic number.
It is an amenable number.
160225014001 is a deficient number, since it is larger than the sum of its proper divisors (12838360847).
160225014001 is a wasteful number, since it uses less digits than its factorization.
160225014001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17952.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 160225014001 its reverse (100410522061), we get a palindrome (260635536062).
The spelling of 160225014001 in words is "one hundred sixty billion, two hundred twenty-five million, fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •