Base | Representation |
---|---|
bin | 10010100000001111101100… |
… | …00011011110111001000100 |
3 | 12100001221220200110102200100 |
4 | 21100013312003132321010 |
5 | 20313132320421144413 |
6 | 222312520143244100 |
7 | 11366531613230355 |
oct | 1120076603367104 |
9 | 170057820412610 |
10 | 40690353303108 |
11 | 11a6875570a5a3 |
12 | 4692090ba9630 |
13 | 19921122b8a22 |
14 | a095d0547d2c |
15 | 4a86b1e53a73 |
hex | 2501f60dee44 |
40690353303108 has 36 divisors (see below), whose sum is σ = 102898377132460. Its totient is φ = 13557885437376.
The previous prime is 40690353303097. The next prime is 40690353303113. The reversal of 40690353303108 is 80130335309604.
40690353303108 is a `hidden beast` number, since 4 + 0 + 6 + 9 + 0 + 3 + 533 + 0 + 3 + 108 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 24582636615744 + 16107716687364 = 4958088^2 + 4013442^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×406903533031082 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 231813703 + ... + 231989166.
Almost surely, 240690353303108 is an apocalyptic number.
It is an amenable number.
40690353303108 is an abundant number, since it is smaller than the sum of its proper divisors (62208023829352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40690353303108 is a wasteful number, since it uses less digits than its factorization.
40690353303108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463805316 (or 463805311 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 45.
The spelling of 40690353303108 in words is "forty trillion, six hundred ninety billion, three hundred fifty-three million, three hundred three thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •