Base | Representation |
---|---|
bin | 10010011111011111110101… |
… | …00111100011100101011000 |
3 | 12022222111121002002200102010 |
4 | 21033233322213203211120 |
5 | 20312222210434031400 |
6 | 222253030440105520 |
7 | 11364632120265435 |
oct | 1117577247434530 |
9 | 168874532080363 |
10 | 40664660064600 |
11 | 11a58870532190 |
12 | 46891004652a0 |
13 | 198c87926c910 |
14 | a082740a6b8c |
15 | 4a7bab497450 |
hex | 24fbfa9e3958 |
40664660064600 has 384 divisors, whose sum is σ = 153205856697600. Its totient is φ = 8785997875200.
The previous prime is 40664660064547. The next prime is 40664660064619. The reversal of 40664660064600 is 646006646604.
It is a super-2 number, since 2×406646600646002 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40664660064600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5683302 + ... + 10659701.
It is an arithmetic number, because the mean of its divisors is an integer number (398973585150).
Almost surely, 240664660064600 is an apocalyptic number.
40664660064600 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40664660064600 is an abundant number, since it is smaller than the sum of its proper divisors (112541196633000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40664660064600 is a wasteful number, since it uses less digits than its factorization.
40664660064600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16343075 (or 16343066 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 48.
The spelling of 40664660064600 in words is "forty trillion, six hundred sixty-four billion, six hundred sixty million, sixty-four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •