Base | Representation |
---|---|
bin | 100101110101110001… |
… | …101000010100000000 |
3 | 10212212121201212211001 |
4 | 211311301220110000 |
5 | 1131202421300422 |
6 | 30355423501344 |
7 | 2635602553603 |
oct | 456561502400 |
9 | 125777655731 |
10 | 40630650112 |
11 | 1625aa40888 |
12 | 7a5b157854 |
13 | 3aa6920000 |
14 | 1d7625233a |
15 | 10cc05b227 |
hex | 975c68500 |
40630650112 has 90 divisors (see below), whose sum is σ = 87876709858. Its totient is φ = 18749233152.
The previous prime is 40630650107. The next prime is 40630650157. The reversal of 40630650112 is 21105603604.
It can be written as a sum of positive squares in 5 ways, for example, as 25019646976 + 15611003136 = 158176^2 + 124944^2 .
It is a super-2 number, since 2×406306501122 (a number of 22 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 7308838 + ... + 7314394.
Almost surely, 240630650112 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 40630650112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43938354929).
40630650112 is an abundant number, since it is smaller than the sum of its proper divisors (47246059746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40630650112 is an frugal number, since it uses more digits than its factorization.
40630650112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5625 (or 5572 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The spelling of 40630650112 in words is "forty billion, six hundred thirty million, six hundred fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •