Base | Representation |
---|---|
bin | 111101100101001001… |
… | …001010111100000001 |
3 | 20022200010002202212021 |
4 | 331211021022330001 |
5 | 2040404040143403 |
6 | 50213055201441 |
7 | 4530356505643 |
oct | 754511127401 |
9 | 208603082767 |
10 | 66121412353 |
11 | 260508a4837 |
12 | 10993b16281 |
13 | 6309a25989 |
14 | 32b3868893 |
15 | 1abed6e8bd |
hex | f6524af01 |
66121412353 has 4 divisors (see below), whose sum is σ = 66121956180. Its totient is φ = 66120868528.
The previous prime is 66121412347. The next prime is 66121412411. The reversal of 66121412353 is 35321412166.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 7862900929 + 58258511424 = 88673^2 + 241368^2 .
It is a cyclic number.
It is not a de Polignac number, because 66121412353 - 29 = 66121411841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66121412303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3351 + ... + 363667.
It is an arithmetic number, because the mean of its divisors is an integer number (16530489045).
Almost surely, 266121412353 is an apocalyptic number.
It is an amenable number.
66121412353 is a deficient number, since it is larger than the sum of its proper divisors (543827).
66121412353 is a wasteful number, since it uses less digits than its factorization.
66121412353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543826.
The product of its digits is 25920, while the sum is 34.
The spelling of 66121412353 in words is "sixty-six billion, one hundred twenty-one million, four hundred twelve thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •