Base | Representation |
---|---|
bin | 10010001111000100011100… |
… | …10111100101101111010111 |
3 | 12020222112122002222012111212 |
4 | 21013202032113211233113 |
5 | 20224000204011132043 |
6 | 221141440135052035 |
7 | 11306100263305055 |
oct | 1107421627455727 |
9 | 166875562865455 |
10 | 40100203224023 |
11 | 11860445345408 |
12 | 45b7830b1101b |
13 | 194b58221cab7 |
14 | 9c8c0851b1d5 |
15 | 498171beb018 |
hex | 24788e5e5bd7 |
40100203224023 has 8 divisors (see below), whose sum is σ = 40119653629776. Its totient is φ = 40080756830400.
The previous prime is 40100203224013. The next prime is 40100203224047. The reversal of 40100203224023 is 32042230200104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40100203224023 - 220 = 40100202175447 is a prime.
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 40100203224023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40100203224013) 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, 19088765 + ... + 21085097.
It is an arithmetic number, because the mean of its divisors is an integer number (5014956703722).
Almost surely, 240100203224023 is an apocalyptic number.
40100203224023 is a deficient number, since it is larger than the sum of its proper divisors (19450405753).
40100203224023 is a wasteful number, since it uses less digits than its factorization.
40100203224023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2006065.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 40100203224023 its reverse (32042230200104), we get a palindrome (72142433424127).
The spelling of 40100203224023 in words is "forty trillion, one hundred billion, two hundred three million, two hundred twenty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •