Base | Representation |
---|---|
bin | 100000010001001101… |
… | …1001000110101001101 |
3 | 20121212102120011022101 |
4 | 1000202123020311031 |
5 | 2113410014004031 |
6 | 51500135315101 |
7 | 5002146630013 |
oct | 1004233106515 |
9 | 217772504271 |
10 | 69297016141 |
11 | 274303a4981 |
12 | 1151b51ba91 |
13 | 66c4902082 |
14 | 34d55028b3 |
15 | 1c08a4e361 |
hex | 10226c8d4d |
69297016141 has 4 divisors (see below), whose sum is σ = 70331300032. Its totient is φ = 68262732252.
The previous prime is 69297016109. The next prime is 69297016301. The reversal of 69297016141 is 14161079296.
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 not a de Polignac number, because 69297016141 - 25 = 69297016109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 69297016091 and 69297016100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69297016441) 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, 517141845 + ... + 517141978.
It is an arithmetic number, because the mean of its divisors is an integer number (17582825008).
Almost surely, 269297016141 is an apocalyptic number.
It is an amenable number.
69297016141 is a deficient number, since it is larger than the sum of its proper divisors (1034283891).
69297016141 is a wasteful number, since it uses less digits than its factorization.
69297016141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034283890.
The product of its (nonzero) digits is 163296, while the sum is 46.
The spelling of 69297016141 in words is "sixty-nine billion, two hundred ninety-seven million, sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •