Base | Representation |
---|---|
bin | 100000000010111110110… |
… | …010010011101010101111 |
3 | 21210112022210012020210002 |
4 | 200002332302103222233 |
5 | 242040123333124401 |
6 | 4403404321334515 |
7 | 315051111054332 |
oct | 40027662235257 |
9 | 7715283166702 |
10 | 2202224114351 |
11 | 779a5a112018 |
12 | 2b698049743b |
13 | 12c8905a8c31 |
14 | 788340c8619 |
15 | 3c441833a6b |
hex | 200bec93aaf |
2202224114351 has 8 divisors (see below), whose sum is σ = 2298042294144. Its totient is φ = 2106411710040.
The previous prime is 2202224114297. The next prime is 2202224114393. The reversal of 2202224114351 is 1534114222022.
2202224114351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-2202224114351 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 (2202224114851) 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, 655505 + ... + 2198666.
It is an arithmetic number, because the mean of its divisors is an integer number (287255286768).
Almost surely, 22202224114351 is an apocalyptic number.
2202224114351 is a deficient number, since it is larger than the sum of its proper divisors (95818179793).
2202224114351 is a wasteful number, since it uses less digits than its factorization.
2202224114351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2887741.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 2202224114351 its reverse (1534114222022), we get a palindrome (3736338336373).
The spelling of 2202224114351 in words is "two trillion, two hundred two billion, two hundred twenty-four million, one hundred fourteen thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •