Base | Representation |
---|---|
bin | 1100010011100100000… |
… | …1001010100000111111 |
3 | 202012200112012221112022 |
4 | 3010321001022200333 |
5 | 11430431430112111 |
6 | 241042002030355 |
7 | 21162636245612 |
oct | 3047101124077 |
9 | 665615187468 |
10 | 211410004031 |
11 | 817274880a6 |
12 | 34b809483bb |
13 | 16c2217b755 |
14 | a3375dc179 |
15 | 57750012db |
hex | 313904a83f |
211410004031 has 8 divisors (see below), whose sum is σ = 222285252000. Its totient is φ = 200773772640.
The previous prime is 211410004007. The next prime is 211410004037. The reversal of 211410004031 is 130400014112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211410004031 is a prime.
It is a super-2 number, since 2×2114100040312 (a number of 23 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 (211410004037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59752331 + ... + 59755868.
It is an arithmetic number, because the mean of its divisors is an integer number (27785656500).
Almost surely, 2211410004031 is an apocalyptic number.
211410004031 is a deficient number, since it is larger than the sum of its proper divisors (10875247969).
211410004031 is a wasteful number, since it uses less digits than its factorization.
211410004031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119508289.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 211410004031 its reverse (130400014112), we get a palindrome (341810018143).
The spelling of 211410004031 in words is "two hundred eleven billion, four hundred ten million, four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •