Base | Representation |
---|---|
bin | 100101011000000000… |
… | …011000100100110101 |
3 | 10211120210221020220010 |
4 | 211120000120210311 |
5 | 1124142041420313 |
6 | 30234102530433 |
7 | 2620326403656 |
oct | 453000304465 |
9 | 124523836803 |
10 | 40131201333 |
11 | 160240205a3 |
12 | 793ba36a19 |
13 | 3a272cbaa2 |
14 | 1d29ba152d |
15 | 109d2a14c3 |
hex | 958018935 |
40131201333 has 8 divisors (see below), whose sum is σ = 53510963200. Its totient is φ = 26752786848.
The previous prime is 40131201323. The next prime is 40131201347. The reversal of 40131201333 is 33310213104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40131201333 - 210 = 40131200309 is a prime.
It is a super-2 number, since 2×401312013332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40131201323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 265168 + ... + 388041.
It is an arithmetic number, because the mean of its divisors is an integer number (6688870400).
Almost surely, 240131201333 is an apocalyptic number.
It is an amenable number.
40131201333 is a deficient number, since it is larger than the sum of its proper divisors (13379761867).
40131201333 is a wasteful number, since it uses less digits than its factorization.
40131201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673691.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 40131201333 its reverse (33310213104), we get a palindrome (73441414437).
The spelling of 40131201333 in words is "forty billion, one hundred thirty-one million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •