Base | Representation |
---|---|
bin | 10011011000110100101… |
… | …10100011100010010000 |
3 | 2100200110222102111101120 |
4 | 21230122112203202100 |
5 | 41403244441114331 |
6 | 1230010340402240 |
7 | 66062055002424 |
oct | 11543226434220 |
9 | 2320428374346 |
10 | 666162051216 |
11 | 237577124972 |
12 | a91343a6380 |
13 | 4aa84c1173c |
14 | 2435728ab84 |
15 | 124dd568796 |
hex | 9b1a5a3890 |
666162051216 has 80 divisors (see below), whose sum is σ = 1750607596800. Its totient is φ = 218225425024.
The previous prime is 666162051211. The next prime is 666162051227. The reversal of 666162051216 is 612150261666.
It is not an unprimeable number, because it can be changed into a prime (666162051211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9989215 + ... + 10055681.
It is an arithmetic number, because the mean of its divisors is an integer number (21882594960).
Almost surely, 2666162051216 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 666162051216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (875303798400).
666162051216 is an abundant number, since it is smaller than the sum of its proper divisors (1084445545584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
666162051216 is a wasteful number, since it uses less digits than its factorization.
666162051216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70076 (or 70070 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 666162051216 in words is "six hundred sixty-six billion, one hundred sixty-two million, fifty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •