Base | Representation |
---|---|
bin | 10010010000111111011110… |
… | …10101101100111101000100 |
3 | 12021012212010100100012212100 |
4 | 21020133233111230331010 |
5 | 20231040442141104201 |
6 | 221232042253552100 |
7 | 11313626143055661 |
oct | 1110375725547504 |
9 | 167185110305770 |
10 | 40166254628676 |
11 | 1188645a673340 |
12 | 46085a54a5630 |
13 | 195487a5a35a7 |
14 | 9cc0b2960a68 |
15 | 499c3a83c886 |
hex | 2487ef56cf44 |
40166254628676 has 72 divisors (see below), whose sum is σ = 110818792453824. Its totient is φ = 12165295343040.
The previous prime is 40166254628627. The next prime is 40166254628729. The reversal of 40166254628676 is 67682645266104.
40166254628676 is a `hidden beast` number, since 4 + 0 + 1 + 6 + 6 + 2 + 546 + 2 + 86 + 7 + 6 = 666.
It is a super-2 number, since 2×401662546286762 (a number of 28 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25470936 + ... + 27001871.
It is an arithmetic number, because the mean of its divisors is an integer number (1539149895192).
Almost surely, 240166254628676 is an apocalyptic number.
It is an amenable number.
40166254628676 is an abundant number, since it is smaller than the sum of its proper divisors (70652537825148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40166254628676 is a wasteful number, since it uses less digits than its factorization.
40166254628676 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52474761 (or 52474756 counting only the distinct ones).
The product of its (nonzero) digits is 139345920, while the sum is 63.
The spelling of 40166254628676 in words is "forty trillion, one hundred sixty-six billion, two hundred fifty-four million, six hundred twenty-eight thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •