Base | Representation |
---|---|
bin | 11110000010100110100001… |
… | …11011010001010001011111 |
3 | 22122220021200002211201021111 |
4 | 33001103100323101101133 |
5 | 32124312042131220110 |
6 | 352255331512242451 |
7 | 16625453626004560 |
oct | 1701232073212137 |
9 | 278807602751244 |
10 | 66060102210655 |
11 | 1a059a28572a33 |
12 | 74aaa826a0427 |
13 | 2ab25968a4237 |
14 | 124547c7c4167 |
15 | 79859522ce8a |
hex | 3c14d0ed145f |
66060102210655 has 32 divisors (see below), whose sum is σ = 95025521562624. Its totient is φ = 43104360093696.
The previous prime is 66060102210607. The next prime is 66060102210659. The reversal of 66060102210655 is 55601220106066.
66060102210655 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 66060102210655 - 29 = 66060102210143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66060102210659) 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, 212441109 + ... + 212751838.
It is an arithmetic number, because the mean of its divisors is an integer number (2969547548832).
Almost surely, 266060102210655 is an apocalyptic number.
66060102210655 is a deficient number, since it is larger than the sum of its proper divisors (28965419351969).
66060102210655 is a wasteful number, since it uses less digits than its factorization.
66060102210655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425193175.
The product of its (nonzero) digits is 129600, while the sum is 40.
The spelling of 66060102210655 in words is "sixty-six trillion, sixty billion, one hundred two million, two hundred ten thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •