Base | Representation |
---|---|
bin | 1000001111101… |
… | …01000010101101 |
3 | 11211010202020110 |
4 | 10013311002231 |
5 | 120201124013 |
6 | 10510210233 |
7 | 1466600646 |
oct | 407650255 |
9 | 154122213 |
10 | 69161133 |
11 | 36048868 |
12 | 1b1b3979 |
13 | 11436a62 |
14 | 92846cd |
15 | 61122c3 |
hex | 41f50ad |
69161133 has 4 divisors (see below), whose sum is σ = 92214848. Its totient is φ = 46107420.
The previous prime is 69161123. The next prime is 69161153. The reversal of 69161133 is 33116196.
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 not a de Polignac number, because 69161133 - 221 = 67063981 is a prime.
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 69161133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69161123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11526853 + ... + 11526858.
It is an arithmetic number, because the mean of its divisors is an integer number (23053712).
Almost surely, 269161133 is an apocalyptic number.
It is an amenable number.
69161133 is a deficient number, since it is larger than the sum of its proper divisors (23053715).
69161133 is a wasteful number, since it uses less digits than its factorization.
69161133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23053714.
The product of its digits is 2916, while the sum is 30.
The square root of 69161133 is about 8316.3172738899. The cubic root of 69161133 is about 410.4756189766.
The spelling of 69161133 in words is "sixty-nine million, one hundred sixty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •