Base | Representation |
---|---|
bin | 100101010110001010000011… |
… | …010000101100101010001001 |
3 | 210112120011211201010221010010 |
4 | 211112022003100230222021 |
5 | 133012034144412314103 |
6 | 1341155322030542133 |
7 | 46411460403146001 |
oct | 4526120320545211 |
9 | 715504751127103 |
10 | 164250341526153 |
11 | 483761a6880813 |
12 | 16508997067949 |
13 | 7085982558c0c |
14 | 2c7ba8a79d001 |
15 | 13ec7dd109903 |
hex | 95628342ca89 |
164250341526153 has 16 divisors (see below), whose sum is σ = 220704278674176. Its totient is φ = 108648558941520.
The previous prime is 164250341526143. The next prime is 164250341526179. The reversal of 164250341526153 is 351625143052461.
It is a happy number.
It is not a de Polignac number, because 164250341526153 - 24 = 164250341526137 is a prime.
It is a super-2 number, since 2×1642503415261532 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (164250341526143) 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, 27655275 + ... + 33065312.
It is an arithmetic number, because the mean of its divisors is an integer number (13794017417136).
Almost surely, 2164250341526153 is an apocalyptic number.
It is an amenable number.
164250341526153 is a deficient number, since it is larger than the sum of its proper divisors (56453937148023).
164250341526153 is a wasteful number, since it uses less digits than its factorization.
164250341526153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60727604.
The product of its (nonzero) digits is 2592000, while the sum is 48.
The spelling of 164250341526153 in words is "one hundred sixty-four trillion, two hundred fifty billion, three hundred forty-one million, five hundred twenty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •