Base | Representation |
---|---|
bin | 1001100110001011001… |
… | …1111001100010111101 |
3 | 120202112211110110102010 |
4 | 2121202303321202331 |
5 | 10200121312420334 |
6 | 203423313521433 |
7 | 14624355243525 |
oct | 2314263714275 |
9 | 522484413363 |
10 | 164866529469 |
11 | 63a12948844 |
12 | 27b51573279 |
13 | 12715566165 |
14 | 7d9dd90685 |
15 | 444dd2c0e9 |
hex | 2662cf98bd |
164866529469 has 4 divisors (see below), whose sum is σ = 219822039296. Its totient is φ = 109911019644.
The previous prime is 164866529461. The next prime is 164866529473. The reversal of 164866529469 is 964925668461.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 964925668461 = 3 ⋅321641889487.
It is not a de Polignac number, because 164866529469 - 23 = 164866529461 is a prime.
It is a super-2 number, since 2×1648665294692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164866529461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27477754909 + ... + 27477754914.
It is an arithmetic number, because the mean of its divisors is an integer number (54955509824).
Almost surely, 2164866529469 is an apocalyptic number.
It is an amenable number.
164866529469 is a deficient number, since it is larger than the sum of its proper divisors (54955509827).
164866529469 is an equidigital number, since it uses as much as digits as its factorization.
164866529469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54955509826.
The product of its digits is 134369280, while the sum is 66.
The spelling of 164866529469 in words is "one hundred sixty-four billion, eight hundred sixty-six million, five hundred twenty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •