Base | Representation |
---|---|
bin | 10011011001100111101… |
… | …11111110010000000000 |
3 | 2100201120211010211102210 |
4 | 21230303313332100000 |
5 | 41410134100214132 |
6 | 1230121034142120 |
7 | 66105504365436 |
oct | 11546367762000 |
9 | 2321524124383 |
10 | 666590241792 |
11 | 2377768a4882 |
12 | a9233881940 |
13 | 4ab22843547 |
14 | 243980acd56 |
15 | 12515e49bcc |
hex | 9b33dfe400 |
666590241792 has 88 divisors (see below), whose sum is σ = 1777023626400. Its totient is φ = 222157029376.
The previous prime is 666590241773. The next prime is 666590241799. The reversal of 666590241792 is 297142095666.
666590241792 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (666590241799) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20809084 + ... + 20841092.
It is an arithmetic number, because the mean of its divisors is an integer number (20193450300).
Almost surely, 2666590241792 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 666590241792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (888511813200).
666590241792 is an abundant number, since it is smaller than the sum of its proper divisors (1110433384608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
666590241792 is a wasteful number, since it uses less digits than its factorization.
666590241792 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38811 (or 38793 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 666590241792 in words is "six hundred sixty-six billion, five hundred ninety million, two hundred forty-one thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •