Base | Representation |
---|---|
bin | 111101110110100101… |
… | …100011000101010001 |
3 | 20100102111210000101102 |
4 | 331312211203011101 |
5 | 2042004000021303 |
6 | 50302111514145 |
7 | 4540542141416 |
oct | 756645430521 |
9 | 210374700342 |
10 | 66414063953 |
11 | 2619100a266 |
12 | 10a55b28955 |
13 | 635554cac3 |
14 | 330068810d |
15 | 1ada8cb288 |
hex | f76963151 |
66414063953 has 4 divisors (see below), whose sum is σ = 66758178468. Its totient is φ = 66069949440.
The previous prime is 66414063943. The next prime is 66414064001. The reversal of 66414063953 is 35936041466.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30174469264 + 36239594689 = 173708^2 + 190367^2 .
It is a cyclic number.
It is not a de Polignac number, because 66414063953 - 230 = 65340322129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66414063898 and 66414063907.
It is not an unprimeable number, because it can be changed into a prime (66414063913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172056968 + ... + 172057353.
It is an arithmetic number, because the mean of its divisors is an integer number (16689544617).
Almost surely, 266414063953 is an apocalyptic number.
It is an amenable number.
66414063953 is a deficient number, since it is larger than the sum of its proper divisors (344114515).
66414063953 is a wasteful number, since it uses less digits than its factorization.
66414063953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344114514.
The product of its (nonzero) digits is 1399680, while the sum is 47.
The spelling of 66414063953 in words is "sixty-six billion, four hundred fourteen million, sixty-three thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •