Base | Representation |
---|---|
bin | 101101111110100110110111… |
… | …011001010010101000010101 |
3 | 222111222111210110100102111021 |
4 | 231332212313121102220111 |
5 | 203001040124110422123 |
6 | 1554024005551041141 |
7 | 60410340064641253 |
oct | 5576466731225025 |
9 | 874874713312437 |
10 | 202214432123413 |
11 | 5948272823a256 |
12 | 1a81a6182101b1 |
13 | 88aa97bb2c1c8 |
14 | 37d13331d55d3 |
15 | 185a0dc530c5d |
hex | b7e9b7652a15 |
202214432123413 has 8 divisors (see below), whose sum is σ = 204129661798400. Its totient is φ = 200304249168240.
The previous prime is 202214432123393. The next prime is 202214432123471. The reversal of 202214432123413 is 314321234412202.
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 202214432123413 - 225 = 202214398568981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202214432123513) 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, 1261599438 + ... + 1261759711.
It is an arithmetic number, because the mean of its divisors is an integer number (25516207724800).
Almost surely, 2202214432123413 is an apocalyptic number.
It is an amenable number.
202214432123413 is a deficient number, since it is larger than the sum of its proper divisors (1915229674987).
202214432123413 is a wasteful number, since it uses less digits than its factorization.
202214432123413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2523359907.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 202214432123413 its reverse (314321234412202), we get a palindrome (516535666535615).
The spelling of 202214432123413 in words is "two hundred two trillion, two hundred fourteen billion, four hundred thirty-two million, one hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •