Base | Representation |
---|---|
bin | 11110000010010100101001… |
… | …00110010111110111110000 |
3 | 22122212100212220220021000210 |
4 | 33001022110212113313300 |
5 | 32124132411020240404 |
6 | 352251103023144120 |
7 | 16624663652654640 |
oct | 1701122446276760 |
9 | 278770786807023 |
10 | 66050500165104 |
11 | 1a055950456aa4 |
12 | 74a9042a45040 |
13 | 2ab16c6490290 |
14 | 1244c0b452520 |
15 | 7981d227c689 |
hex | 3c1294997df0 |
66050500165104 has 160 divisors (see below), whose sum is σ = 210012453898240. Its totient is φ = 17419436384256.
The previous prime is 66050500165099. The next prime is 66050500165163. The reversal of 66050500165104 is 40156100505066.
66050500165104 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
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 31 ways as a sum of consecutive naturals, for example, 177193929 + ... + 177566295.
It is an arithmetic number, because the mean of its divisors is an integer number (1312577836864).
Almost surely, 266050500165104 is an apocalyptic number.
It is an amenable number.
66050500165104 is an abundant number, since it is smaller than the sum of its proper divisors (143961953733136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66050500165104 is a wasteful number, since it uses less digits than its factorization.
66050500165104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413007 (or 413001 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 66050500165104 in words is "sixty-six trillion, fifty billion, five hundred million, one hundred sixty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •