Base | Representation |
---|---|
bin | 10010001111000110010100… |
… | …11001000000110101011111 |
3 | 12020222122020021211102011122 |
4 | 21013203022121000311133 |
5 | 20224004234304330421 |
6 | 221142124110441155 |
7 | 11306134241565632 |
oct | 1107431231006537 |
9 | 166878207742148 |
10 | 40101210230111 |
11 | 11860911813a48 |
12 | 45b7a722031bb |
13 | 194b6b2a40ba4 |
14 | 9c8ca216dc19 |
15 | 4981d03132ab |
hex | 2478ca640d5f |
40101210230111 has 4 divisors (see below), whose sum is σ = 40101560051424. Its totient is φ = 40100860408800.
The previous prime is 40101210230009. The next prime is 40101210230129. The reversal of 40101210230111 is 11103201210104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40101210230111 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 40101210230111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40101210230131) 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, 174738650 + ... + 174967991.
It is an arithmetic number, because the mean of its divisors is an integer number (10025390012856).
Almost surely, 240101210230111 is an apocalyptic number.
40101210230111 is a deficient number, since it is larger than the sum of its proper divisors (349821313).
40101210230111 is a wasteful number, since it uses less digits than its factorization.
40101210230111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349821312.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 40101210230111 its reverse (11103201210104), we get a palindrome (51204411440215).
The spelling of 40101210230111 in words is "forty trillion, one hundred one billion, two hundred ten million, two hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.031 sec. • engine limits •