Base | Representation |
---|---|
bin | 10010001111000100011100… |
… | …10111100101101111010101 |
3 | 12020222112122002222012111210 |
4 | 21013202032113211233111 |
5 | 20224000204011132041 |
6 | 221141440135052033 |
7 | 11306100263305053 |
oct | 1107421627455725 |
9 | 166875562865453 |
10 | 40100203224021 |
11 | 11860445345406 |
12 | 45b7830b11019 |
13 | 194b58221cab5 |
14 | 9c8c0851b1d3 |
15 | 498171beb016 |
hex | 24788e5e5bd5 |
40100203224021 has 8 divisors (see below), whose sum is σ = 53476385779360. Its totient is φ = 26728744742352.
The previous prime is 40100203224013. The next prime is 40100203224047. The reversal of 40100203224021 is 12042230200104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40100203224021 - 23 = 40100203224013 is a prime.
It is a super-2 number, since 2×401002032240212 (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 (40100203222021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1180998610 + ... + 1181032563.
It is an arithmetic number, because the mean of its divisors is an integer number (6684548222420).
Almost surely, 240100203224021 is an apocalyptic number.
It is an amenable number.
40100203224021 is a deficient number, since it is larger than the sum of its proper divisors (13376182555339).
40100203224021 is a wasteful number, since it uses less digits than its factorization.
40100203224021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2362036835.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 40100203224021 its reverse (12042230200104), we get a palindrome (52142433424125).
The spelling of 40100203224021 in words is "forty trillion, one hundred billion, two hundred three million, two hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •