Base | Representation |
---|---|
bin | 100000001100010101… |
… | …1001011101111001111 |
3 | 20121110000210011000020 |
4 | 1000120223023233033 |
5 | 2113041130401231 |
6 | 51432013433223 |
7 | 4665122426241 |
oct | 1003053135717 |
9 | 217400704006 |
10 | 69133450191 |
11 | 27357037403 |
12 | 1149479b813 |
13 | 6699a634a0 |
14 | 34bb8c6091 |
15 | 1be94e0396 |
hex | 1018acbbcf |
69133450191 has 32 divisors (see below), whose sum is σ = 100132919040. Its totient is φ = 42173913600.
The previous prime is 69133450159. The next prime is 69133450193. The reversal of 69133450191 is 19105433196.
It is not a de Polignac number, because 69133450191 - 25 = 69133450159 is a prime.
It is a super-2 number, since 2×691334501912 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69133450193) 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 31 ways as a sum of consecutive naturals, for example, 5148276 + ... + 5161686.
It is an arithmetic number, because the mean of its divisors is an integer number (3129153720).
Almost surely, 269133450191 is an apocalyptic number.
69133450191 is a deficient number, since it is larger than the sum of its proper divisors (30999468849).
69133450191 is a wasteful number, since it uses less digits than its factorization.
69133450191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14567.
The product of its (nonzero) digits is 87480, while the sum is 42.
The spelling of 69133450191 in words is "sixty-nine billion, one hundred thirty-three million, four hundred fifty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •