Base | Representation |
---|---|
bin | 11110000100100001101010… |
… | …10000100011011111110110 |
3 | 22200010121022021100110012020 |
4 | 33002100311100203133312 |
5 | 32131402434231140431 |
6 | 352345543404134010 |
7 | 16633314062063565 |
oct | 1702206520433766 |
9 | 280117267313166 |
10 | 66126210021366 |
11 | 1a084a71717640 |
12 | 74bb851b37306 |
13 | 2ab88a0846bb1 |
14 | 124875050bbdc |
15 | 79a163cb2696 |
hex | 3c24354237f6 |
66126210021366 has 16 divisors (see below), whose sum is σ = 144275367319488. Its totient is φ = 20038245461000.
The previous prime is 66126210021353. The next prime is 66126210021371. The reversal of 66126210021366 is 66312001262166.
66126210021366 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
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, 500956136460 + ... + 500956136591.
It is an arithmetic number, because the mean of its divisors is an integer number (9017210457468).
Almost surely, 266126210021366 is an apocalyptic number.
66126210021366 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
66126210021366 is an abundant number, since it is smaller than the sum of its proper divisors (78149157298122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66126210021366 is a wasteful number, since it uses less digits than its factorization.
66126210021366 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001912273067.
The product of its (nonzero) digits is 186624, while the sum is 42.
The spelling of 66126210021366 in words is "sixty-six trillion, one hundred twenty-six billion, two hundred ten million, twenty-one thousand, three hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •