Base | Representation |
---|---|
bin | 11110000011111011010101… |
… | …01000010111110101011011 |
3 | 22200001122012001120121002101 |
4 | 33001331222220113311123 |
5 | 32131033312414333034 |
6 | 352332301340144231 |
7 | 16631655103055053 |
oct | 1701755250276533 |
9 | 280048161517071 |
10 | 66105630621019 |
11 | 1a07727112a560 |
12 | 74b7869b38077 |
13 | 2ab6971106a22 |
14 | 124775b2c2563 |
15 | 79985c247514 |
hex | 3c1f6aa17d5b |
66105630621019 has 4 divisors (see below), whose sum is σ = 72115233404760. Its totient is φ = 60096027837280.
The previous prime is 66105630621013. The next prime is 66105630621071. The reversal of 66105630621019 is 91012603650166.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 66105630621019 - 29 = 66105630620507 is a prime.
It is a super-2 number, since 2×661056306210192 (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 66105630621019.
It is not an unprimeable number, because it can be changed into a prime (66105630621013) 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, 3004801391854 + ... + 3004801391875.
It is an arithmetic number, because the mean of its divisors is an integer number (18028808351190).
Almost surely, 266105630621019 is an apocalyptic number.
66105630621019 is a deficient number, since it is larger than the sum of its proper divisors (6009602783741).
66105630621019 is a wasteful number, since it uses less digits than its factorization.
66105630621019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6009602783740.
The product of its (nonzero) digits is 349920, while the sum is 46.
The spelling of 66105630621019 in words is "sixty-six trillion, one hundred five billion, six hundred thirty million, six hundred twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •