Base | Representation |
---|---|
bin | 100101110110000010… |
… | …101111001001000011 |
3 | 10212212221011201021122 |
4 | 211312002233021003 |
5 | 1131210043301111 |
6 | 30400103542455 |
7 | 2635655641655 |
oct | 456602571103 |
9 | 125787151248 |
10 | 40635134531 |
11 | 16262524012 |
12 | 7a6075aa2b |
13 | 3aa7830204 |
14 | 1d76a9c6d5 |
15 | 10cc644cdb |
hex | 9760af243 |
40635134531 has 4 divisors (see below), whose sum is σ = 40741231872. Its totient is φ = 40529037192.
The previous prime is 40635134513. The next prime is 40635134537. The reversal of 40635134531 is 13543153604.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40635134531 - 26 = 40635134467 is a prime.
It is a super-3 number, since 3×406351345313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40635134491 and 40635134500.
It is not an unprimeable number, because it can be changed into a prime (40635134537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53048096 + ... + 53048861.
It is an arithmetic number, because the mean of its divisors is an integer number (10185307968).
Almost surely, 240635134531 is an apocalyptic number.
40635134531 is a deficient number, since it is larger than the sum of its proper divisors (106097341).
40635134531 is a wasteful number, since it uses less digits than its factorization.
40635134531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106097340.
The product of its (nonzero) digits is 64800, while the sum is 35.
The spelling of 40635134531 in words is "forty billion, six hundred thirty-five million, one hundred thirty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •