Base | Representation |
---|---|
bin | 1001110101101100011… |
… | …1100001011000111001 |
3 | 121011022011022202221222 |
4 | 2131123013201120321 |
5 | 10232134300013334 |
6 | 205352531241425 |
7 | 15132531613604 |
oct | 2353307413071 |
9 | 534264282858 |
10 | 169032422969 |
11 | 6576043a233 |
12 | 28914749275 |
13 | 12c2a65c9b7 |
14 | 827736933b |
15 | 45e4920d2e |
hex | 275b1e1639 |
169032422969 has 4 divisors (see below), whose sum is σ = 169091714640. Its totient is φ = 168973131300.
The previous prime is 169032422891. The next prime is 169032423071. The reversal of 169032422969 is 969224230961.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-169032422969 is a prime.
It is a super-2 number, since 2×1690324229692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 169032422969.
It is not an unprimeable number, because it can be changed into a prime (169032452969) 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, 29641559 + ... + 29647260.
It is an arithmetic number, because the mean of its divisors is an integer number (42272928660).
Almost surely, 2169032422969 is an apocalyptic number.
It is an amenable number.
169032422969 is a deficient number, since it is larger than the sum of its proper divisors (59291671).
169032422969 is an equidigital number, since it uses as much as digits as its factorization.
169032422969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59291670.
The product of its (nonzero) digits is 2519424, while the sum is 53.
The spelling of 169032422969 in words is "one hundred sixty-nine billion, thirty-two million, four hundred twenty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •