Base | Representation |
---|---|
bin | 100101011000010001… |
… | …011001001001100101 |
3 | 10211121010022210012212 |
4 | 211120101121021211 |
5 | 1124144212111013 |
6 | 30234342253205 |
7 | 2620412324252 |
oct | 453021311145 |
9 | 124533283185 |
10 | 40135660133 |
11 | 16026596558 |
12 | 7941427205 |
13 | 3a2820042a |
14 | 1d2a602429 |
15 | 109d8826a8 |
hex | 958459265 |
40135660133 has 4 divisors (see below), whose sum is σ = 40222346688. Its totient is φ = 40048973580.
The previous prime is 40135660067. The next prime is 40135660141. The reversal of 40135660133 is 33106653104.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40135660133 - 226 = 40068551269 is a prime.
It is a super-2 number, since 2×401356601332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40135660133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40135660163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43342583 + ... + 43343508.
It is an arithmetic number, because the mean of its divisors is an integer number (10055586672).
Almost surely, 240135660133 is an apocalyptic number.
It is an amenable number.
40135660133 is a deficient number, since it is larger than the sum of its proper divisors (86686555).
40135660133 is an equidigital number, since it uses as much as digits as its factorization.
40135660133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86686554.
The product of its (nonzero) digits is 19440, while the sum is 32.
The spelling of 40135660133 in words is "forty billion, one hundred thirty-five million, six hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •