Base | Representation |
---|---|
bin | 110101111100000110100… |
… | …011011110101010110001 |
3 | 111010100112222102011202012 |
4 | 311330012203132222301 |
5 | 441212223141143101 |
6 | 11514452540132305 |
7 | 531540441304412 |
oct | 65740643365261 |
9 | 14110488364665 |
10 | 3706666740401 |
11 | 11a9a96819089 |
12 | 4ba463237095 |
13 | 20b6ca22b441 |
14 | cb5917a7809 |
15 | 66643c36bbb |
hex | 35f068deab1 |
3706666740401 has 8 divisors (see below), whose sum is σ = 4007207287680. Its totient is φ = 3416671475568.
The previous prime is 3706666740353. The next prime is 3706666740409. The reversal of 3706666740401 is 1040476666073.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3706666740401 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3706666740401.
It is not an unprimeable number, because it can be changed into a prime (3706666740409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2636319881 + ... + 2636321286.
It is an arithmetic number, because the mean of its divisors is an integer number (500900910960).
Almost surely, 23706666740401 is an apocalyptic number.
It is an amenable number.
3706666740401 is a deficient number, since it is larger than the sum of its proper divisors (300540547279).
3706666740401 is a wasteful number, since it uses less digits than its factorization.
3706666740401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5272641223.
The product of its (nonzero) digits is 3048192, while the sum is 50.
The spelling of 3706666740401 in words is "three trillion, seven hundred six billion, six hundred sixty-six million, seven hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •