Base | Representation |
---|---|
bin | 100000011010001001… |
… | …1001101111111010101 |
3 | 20122122022220100210021 |
4 | 1000310103031333111 |
5 | 2120013303230010 |
6 | 51550011425141 |
7 | 5012451100321 |
oct | 1006423157725 |
9 | 218568810707 |
10 | 69596930005 |
11 | 2757471a679 |
12 | 115a3a551b1 |
13 | 6741a9c8b5 |
14 | 3523292981 |
15 | 1c250428da |
hex | 10344cdfd5 |
69596930005 has 8 divisors (see below), whose sum is σ = 84282521400. Its totient is φ = 55166740416.
The previous prime is 69596929993. The next prime is 69596930009. The reversal of 69596930005 is 50003969596.
It can be written as a sum of positive squares in 4 ways, for example, as 6542706769 + 63054223236 = 80887^2 + 251106^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 69596930005 - 229 = 69060059093 is a prime.
It is a super-2 number, since 2×695969300052 (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 (69596930009) 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 7 ways as a sum of consecutive naturals, for example, 63849850 + ... + 63850939.
It is an arithmetic number, because the mean of its divisors is an integer number (10535315175).
Almost surely, 269596930005 is an apocalyptic number.
It is an amenable number.
69596930005 is a deficient number, since it is larger than the sum of its proper divisors (14685591395).
69596930005 is a wasteful number, since it uses less digits than its factorization.
69596930005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127700903.
The product of its (nonzero) digits is 1968300, while the sum is 52.
The spelling of 69596930005 in words is "sixty-nine billion, five hundred ninety-six million, nine hundred thirty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •