Base | Representation |
---|---|
bin | 1011101001111001011… |
… | …0001011110010110111 |
3 | 201010211000212112001010 |
4 | 2322132112023302313 |
5 | 11240030112024343 |
6 | 231552051003303 |
7 | 20315523235644 |
oct | 2723626136267 |
9 | 633730775033 |
10 | 200225111223 |
11 | 77a07945635 |
12 | 3297ab99533 |
13 | 15b5bb59197 |
14 | 9995d5cdcb |
15 | 531d0ddd33 |
hex | 2e9e58bcb7 |
200225111223 has 8 divisors (see below), whose sum is σ = 282670745328. Its totient is φ = 125631442304.
The previous prime is 200225111221. The next prime is 200225111263. The reversal of 200225111223 is 322111522002.
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 200225111223 - 21 = 200225111221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200225111223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200225111221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1962991236 + ... + 1962991337.
It is an arithmetic number, because the mean of its divisors is an integer number (35333843166).
Almost surely, 2200225111223 is an apocalyptic number.
200225111223 is a deficient number, since it is larger than the sum of its proper divisors (82445634105).
200225111223 is a wasteful number, since it uses less digits than its factorization.
200225111223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3925982593.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 200225111223 its reverse (322111522002), we get a palindrome (522336633225).
The spelling of 200225111223 in words is "two hundred billion, two hundred twenty-five million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •