Base | Representation |
---|---|
bin | 10010101000001100011100… |
… | …11101001010101100100000 |
3 | 12101001001221021012101222002 |
4 | 21110012032131022230200 |
5 | 20332121213214100413 |
6 | 223042211405303132 |
7 | 11425341355264523 |
oct | 1124061635125440 |
9 | 171031837171862 |
10 | 40963493112608 |
11 | 12063579a45150 |
12 | 4716bbab64aa8 |
13 | 19b1ac13a8491 |
14 | a1890223cbba |
15 | 4b084b497958 |
hex | 25418e74ab20 |
40963493112608 has 96 divisors (see below), whose sum is σ = 88566910306560. Its totient is φ = 18495608320000.
The previous prime is 40963493112599. The next prime is 40963493112631. The reversal of 40963493112608 is 80621139436904.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33128198 + ... + 34342458.
It is an arithmetic number, because the mean of its divisors is an integer number (922571982360).
Almost surely, 240963493112608 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 40963493112608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44283455153280).
40963493112608 is an abundant number, since it is smaller than the sum of its proper divisors (47603417193952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40963493112608 is a wasteful number, since it uses less digits than its factorization.
40963493112608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1214922 (or 1214914 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 56.
The spelling of 40963493112608 in words is "forty trillion, nine hundred sixty-three billion, four hundred ninety-three million, one hundred twelve thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •