Base | Representation |
---|---|
bin | 110000110010110010101… |
… | …1100010011111001111011 |
3 | 212202002201211120110120001 |
4 | 1201211211130103321323 |
5 | 1334333141320310220 |
6 | 22132432203413431 |
7 | 1261334355240325 |
oct | 141454534237173 |
9 | 25662654513501 |
10 | 6706145869435 |
11 | 2156073572791 |
12 | 903842824277 |
13 | 398504b7956c |
14 | 192817434615 |
15 | b969788d80a |
hex | 61965713e7b |
6706145869435 has 8 divisors (see below), whose sum is σ = 8047388998800. Its totient is φ = 5364907391904.
The previous prime is 6706145869433. The next prime is 6706145869453. The reversal of 6706145869435 is 5349685416076.
6706145869435 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 6706145869435 - 21 = 6706145869433 is a prime.
It is a super-2 number, since 2×67061458694352 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6706145869433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4650264 + ... + 5919226.
It is an arithmetic number, because the mean of its divisors is an integer number (1005923624850).
Almost surely, 26706145869435 is an apocalyptic number.
6706145869435 is a deficient number, since it is larger than the sum of its proper divisors (1341243129365).
6706145869435 is a wasteful number, since it uses less digits than its factorization.
6706145869435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2325917.
The product of its (nonzero) digits is 130636800, while the sum is 64.
The spelling of 6706145869435 in words is "six trillion, seven hundred six billion, one hundred forty-five million, eight hundred sixty-nine thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •