Base | Representation |
---|---|
bin | 110000101110101000101011… |
… | …000101111101110111001011 |
3 | 1001002210221011011000211221110 |
4 | 300232220223011331313023 |
5 | 211042232412241321303 |
6 | 2035445040441541403 |
7 | 63066313251620421 |
oct | 6056505305756713 |
9 | 1032727134024843 |
10 | 214311001120203 |
11 | 62316870068709 |
12 | 20052aa87a4863 |
13 | 927759626bbc0 |
14 | 3acc9ca2b7111 |
15 | 19b9ac335c703 |
hex | c2ea2b17ddcb |
214311001120203 has 32 divisors (see below), whose sum is σ = 325839302401536. Its totient is φ = 124122399349248.
The previous prime is 214311001120199. The next prime is 214311001120211. The reversal of 214311001120203 is 302021100113412.
It is not a de Polignac number, because 214311001120203 - 22 = 214311001120199 is a prime.
It is a super-2 number, since 2×2143110011202032 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 214311001120203.
It is not an unprimeable number, because it can be changed into a prime (214311001120273) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19648276 + ... + 28542542.
It is an arithmetic number, because the mean of its divisors is an integer number (10182478200048).
Almost surely, 2214311001120203 is an apocalyptic number.
214311001120203 is a deficient number, since it is larger than the sum of its proper divisors (111528301281333).
214311001120203 is a wasteful number, since it uses less digits than its factorization.
214311001120203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8930643.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 214311001120203 its reverse (302021100113412), we get a palindrome (516332101233615).
The spelling of 214311001120203 in words is "two hundred fourteen trillion, three hundred eleven billion, one million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •