Base | Representation |
---|---|
bin | 11110001001111100111010… |
… | …00001001110010000110110 |
3 | 22200210102111111202110101220 |
4 | 33010332131001032100312 |
5 | 32142431233403121142 |
6 | 353011334222131210 |
7 | 16652633620300566 |
oct | 1704763501162066 |
9 | 280712444673356 |
10 | 66312634426422 |
11 | 1a14703740438a |
12 | 752b9bb120b06 |
13 | 2b00340461c47 |
14 | 1253797630da6 |
15 | 79ee254d82ec |
hex | 3c4f9d04e436 |
66312634426422 has 16 divisors (see below), whose sum is σ = 136903503332352. Its totient is φ = 21391172395560.
The previous prime is 66312634426417. The next prime is 66312634426471. The reversal of 66312634426422 is 22462443621366.
66312634426422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178259769778 + ... + 178259770149.
It is an arithmetic number, because the mean of its divisors is an integer number (8556468958272).
Almost surely, 266312634426422 is an apocalyptic number.
66312634426422 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
66312634426422 is an abundant number, since it is smaller than the sum of its proper divisors (70590868905930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66312634426422 is a wasteful number, since it uses less digits than its factorization.
66312634426422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356519539963.
The product of its digits is 11943936, while the sum is 51.
The spelling of 66312634426422 in words is "sixty-six trillion, three hundred twelve billion, six hundred thirty-four million, four hundred twenty-six thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •