Base | Representation |
---|---|
bin | 11110000010011101000111… |
… | …11111110101011000101011 |
3 | 22122212210122020201212102112 |
4 | 33001032203333311120223 |
5 | 32124221222141341011 |
6 | 352253134520152535 |
7 | 16625214542246063 |
oct | 1701164377653053 |
9 | 278783566655375 |
10 | 66055053465131 |
11 | 1a0578776a1775 |
12 | 74a9ab390874b |
13 | 2ab1c70909253 |
14 | 12451200743a3 |
15 | 79839bd9858b |
hex | 3c13a3ff562b |
66055053465131 has 8 divisors (see below), whose sum is σ = 66270912791904. Its totient is φ = 65839535419840.
The previous prime is 66055053465119. The next prime is 66055053465133. The reversal of 66055053465131 is 13156435055066.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 66055053465131 - 218 = 66055053202987 is a prime.
It is a super-2 number, since 2×660550534651312 (a number of 28 digits) contains 22 as substring.
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 66055053465131.
It is not an unprimeable number, because it can be changed into a prime (66055053465133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84932636 + ... + 85706841.
It is an arithmetic number, because the mean of its divisors is an integer number (8283864098988).
Almost surely, 266055053465131 is an apocalyptic number.
66055053465131 is a deficient number, since it is larger than the sum of its proper divisors (215859326773).
66055053465131 is a wasteful number, since it uses less digits than its factorization.
66055053465131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170640741.
The product of its (nonzero) digits is 4860000, while the sum is 50.
The spelling of 66055053465131 in words is "sixty-six trillion, fifty-five billion, fifty-three million, four hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •