Base | Representation |
---|---|
bin | 101111110000011111001101… |
… | …111001001101111111110111 |
3 | 1000112200122120110112101000110 |
4 | 233300133031321031333313 |
5 | 210012244402420130421 |
6 | 2022415053145314103 |
7 | 62145622644246225 |
oct | 5760371571157767 |
9 | 1015618513471013 |
10 | 210040240005111 |
11 | 60a1a62482183a |
12 | 1b683257495933 |
13 | 902792c11cbc9 |
14 | 39c2005157b15 |
15 | 1943966ac6a76 |
hex | bf07cde4dff7 |
210040240005111 has 8 divisors (see below), whose sum is σ = 280486502884224. Its totient is φ = 139810401898040.
The previous prime is 210040240005109. The next prime is 210040240005131. The reversal of 210040240005111 is 111500042040012.
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 210040240005111 - 21 = 210040240005109 is a prime.
It is a super-2 number, since 2×2100402400051112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210040240005131) 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, 54106190745 + ... + 54106194626.
It is an arithmetic number, because the mean of its divisors is an integer number (35060812860528).
Almost surely, 2210040240005111 is an apocalyptic number.
210040240005111 is a deficient number, since it is larger than the sum of its proper divisors (70446262879113).
210040240005111 is a wasteful number, since it uses less digits than its factorization.
210040240005111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108212386021.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 210040240005111 its reverse (111500042040012), we get a palindrome (321540282045123).
The spelling of 210040240005111 in words is "two hundred ten trillion, forty billion, two hundred forty million, five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •