Base | Representation |
---|---|
bin | 10010011111000100100010… |
… | …11111100100010000000100 |
3 | 12022221002210012011111102200 |
4 | 21033202101133210100010 |
5 | 20312002210413214422 |
6 | 222242205113434500 |
7 | 11363603115226251 |
oct | 1117422137442004 |
9 | 168832705144380 |
10 | 40650011460612 |
11 | 11a526337a91a4 |
12 | 46862b270ba30 |
13 | 198b3834782c8 |
14 | a076847d4428 |
15 | 4a76004452ac |
hex | 24f8917e4404 |
40650011460612 has 36 divisors (see below), whose sum is σ = 102785267662896. Its totient is φ = 13545906410160.
The previous prime is 40650011460557. The next prime is 40650011460613. The reversal of 40650011460612 is 21606411005604.
40650011460612 is a `hidden beast` number, since 4 + 0 + 6 + 500 + 1 + 146 + 0 + 6 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (40650011460613) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 170604714 + ... + 170842817.
Almost surely, 240650011460612 is an apocalyptic number.
It is an amenable number.
40650011460612 is an abundant number, since it is smaller than the sum of its proper divisors (62135256202284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40650011460612 is a wasteful number, since it uses less digits than its factorization.
40650011460612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341450848 (or 341450843 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 40650011460612 in words is "forty trillion, six hundred fifty billion, eleven million, four hundred sixty thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •