Base | Representation |
---|---|
bin | 11110000100101000110111… |
… | …01100001010111100100011 |
3 | 22200010222021200220120000220 |
4 | 33002110123230022330203 |
5 | 32131433343430124030 |
6 | 352351423150014123 |
7 | 16633511634404253 |
oct | 1702243354127443 |
9 | 280128250816026 |
10 | 66130076020515 |
11 | 1a0866759a6a61 |
12 | 75005507a7343 |
13 | 2ab906877ba60 |
14 | 12489d9b3d963 |
15 | 79a2dd3b8a10 |
hex | 3c251bb0af23 |
66130076020515 has 32 divisors (see below), whose sum is σ = 120649984854336. Its totient is φ = 30641265991680.
The previous prime is 66130076020513. The next prime is 66130076020543. The reversal of 66130076020515 is 51502067003166.
66130076020515 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 66130076020515 - 21 = 66130076020513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (66130076020513) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 9974367126 + ... + 9974373755.
It is an arithmetic number, because the mean of its divisors is an integer number (3770312026698).
Almost surely, 266130076020515 is an apocalyptic number.
66130076020515 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
66130076020515 is a deficient number, since it is larger than the sum of its proper divisors (54519908833821).
66130076020515 is a wasteful number, since it uses less digits than its factorization.
66130076020515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19948740919.
The product of its (nonzero) digits is 226800, while the sum is 42.
The spelling of 66130076020515 in words is "sixty-six trillion, one hundred thirty billion, seventy-six million, twenty thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •