Base | Representation |
---|---|
bin | 10010010010000110011000… |
… | …10110011111110010111111 |
3 | 12021100111101100110022122201 |
4 | 21021003030112133302333 |
5 | 20232201423004340111 |
6 | 221301335525052331 |
7 | 11316444405220123 |
oct | 1111031426376277 |
9 | 167314340408581 |
10 | 40204322340031 |
11 | 118a0614922313 |
12 | 4613a4a2570a7 |
13 | 1958336228695 |
14 | 9cdc8465b583 |
15 | 49ac178896c1 |
hex | 2490cc59fcbf |
40204322340031 has 4 divisors (see below), whose sum is σ = 40414816174464. Its totient is φ = 39993828505600.
The previous prime is 40204322340029. The next prime is 40204322340037. The reversal of 40204322340031 is 13004322340204.
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 40204322340031 - 21 = 40204322340029 is a prime.
It is a super-2 number, since 2×402043223400312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40204322340037) 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, 105246916930 + ... + 105246917311.
It is an arithmetic number, because the mean of its divisors is an integer number (10103704043616).
Almost surely, 240204322340031 is an apocalyptic number.
40204322340031 is a deficient number, since it is larger than the sum of its proper divisors (210493834433).
40204322340031 is a wasteful number, since it uses less digits than its factorization.
40204322340031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210493834432.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 40204322340031 its reverse (13004322340204), we get a palindrome (53208644680235).
The spelling of 40204322340031 in words is "forty trillion, two hundred four billion, three hundred twenty-two million, three hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •