Base | Representation |
---|---|
bin | 110101011000010110101… |
… | …001100110111000100011 |
3 | 110222200110212220020002022 |
4 | 311120112221212320203 |
5 | 440100120202423312 |
6 | 11445104023412055 |
7 | 526011310120043 |
oct | 65302651467043 |
9 | 13880425806068 |
10 | 3668282076707 |
11 | 1194789667126 |
12 | 4b2b302b402b |
13 | 207bc0a213a1 |
14 | c978d963723 |
15 | 65648e7d172 |
hex | 35616a66e23 |
3668282076707 has 4 divisors (see below), whose sum is σ = 3677522082336. Its totient is φ = 3659042071080.
The previous prime is 3668282076703. The next prime is 3668282076749. The reversal of 3668282076707 is 7076702828663.
3668282076707 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3668282076707 - 22 = 3668282076703 is a prime.
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 3668282076707.
It is not an unprimeable number, because it can be changed into a prime (3668282076703) 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, 4620002219 + ... + 4620003012.
It is an arithmetic number, because the mean of its divisors is an integer number (919380520584).
Almost surely, 23668282076707 is an apocalyptic number.
3668282076707 is a deficient number, since it is larger than the sum of its proper divisors (9240005629).
3668282076707 is an equidigital number, since it uses as much as digits as its factorization.
3668282076707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9240005628.
The product of its (nonzero) digits is 56899584, while the sum is 62.
The spelling of 3668282076707 in words is "three trillion, six hundred sixty-eight billion, two hundred eighty-two million, seventy-six thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •