Base | Representation |
---|---|
bin | 100000100100110100… |
… | …1010000101010100111 |
3 | 20200120021201201011212 |
4 | 1001021221100222213 |
5 | 2121231441422141 |
6 | 52045323022035 |
7 | 5024356640552 |
oct | 1011151205247 |
9 | 220507651155 |
10 | 69955029671 |
11 | 2773887720a |
12 | 1168396a91b |
13 | 679b0306a7 |
14 | 3558a6b699 |
15 | 1c466cb2eb |
hex | 1049a50aa7 |
69955029671 has 4 divisors (see below), whose sum is σ = 71140708200. Its totient is φ = 68769351144.
The previous prime is 69955029653. The next prime is 69955029701. The reversal of 69955029671 is 17692055996.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 69955029671 - 226 = 69887920807 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (59), and also a Moran number because the ratio is a prime number: 1185678469 = 69955029671 / (6 + 9 + 9 + 5 + 5 + 0 + 2 + 9 + 6 + 7 + 1).
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 69955029671.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69955022671) 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, 592839176 + ... + 592839293.
It is an arithmetic number, because the mean of its divisors is an integer number (17785177050).
Almost surely, 269955029671 is an apocalyptic number.
69955029671 is a deficient number, since it is larger than the sum of its proper divisors (1185678529).
69955029671 is a wasteful number, since it uses less digits than its factorization.
69955029671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185678528.
The product of its (nonzero) digits is 9185400, while the sum is 59.
The spelling of 69955029671 in words is "sixty-nine billion, nine hundred fifty-five million, twenty-nine thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •