Base | Representation |
---|---|
bin | 111110010101100000… |
… | …010111111110101001 |
3 | 20101202122212121110021 |
4 | 332111200113332221 |
5 | 2044034244121244 |
6 | 50425402120441 |
7 | 4556441265553 |
oct | 762540277651 |
9 | 211678777407 |
10 | 66932801449 |
11 | 26427904438 |
12 | 10b7b7b0121 |
13 | 6408b65777 |
14 | 334d51a4d3 |
15 | 1b1b1e6284 |
hex | f95817fa9 |
66932801449 has 4 divisors (see below), whose sum is σ = 66940271440. Its totient is φ = 66925331460.
The previous prime is 66932801447. The next prime is 66932801459. The reversal of 66932801449 is 94410823966.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 66932801449 - 21 = 66932801447 is a prime.
It is a super-3 number, since 3×669328014493 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66932801396 and 66932801405.
It is not an unprimeable number, because it can be changed into a prime (66932801447) 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, 3721539 + ... + 3739480.
It is an arithmetic number, because the mean of its divisors is an integer number (16735067860).
Almost surely, 266932801449 is an apocalyptic number.
It is an amenable number.
66932801449 is a deficient number, since it is larger than the sum of its proper divisors (7469991).
66932801449 is an equidigital number, since it uses as much as digits as its factorization.
66932801449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7469990.
The product of its (nonzero) digits is 2239488, while the sum is 52.
The spelling of 66932801449 in words is "sixty-six billion, nine hundred thirty-two million, eight hundred one thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •