Base | Representation |
---|---|
bin | 1100111111100001100… |
… | …0101011001100100011 |
3 | 210100010221000210110022 |
4 | 3033320120223030203 |
5 | 12124113400100201 |
6 | 250312544424055 |
7 | 22061236241066 |
oct | 3177030531443 |
9 | 710127023408 |
10 | 223210550051 |
11 | 86732599a75 |
12 | 3731491802b |
13 | 18082bba668 |
14 | ab3693a8dd |
15 | 5c15ec441b |
hex | 33f862b323 |
223210550051 has 4 divisors (see below), whose sum is σ = 230907465600. Its totient is φ = 215513634504.
The previous prime is 223210550047. The next prime is 223210550063. The reversal of 223210550051 is 150055012322.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 223210550051 - 22 = 223210550047 is a prime.
It is a super-3 number, since 3×2232105500513 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 223210550051.
It is not an unprimeable number, because it can be changed into a prime (223210550021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3848457731 + ... + 3848457788.
It is an arithmetic number, because the mean of its divisors is an integer number (57726866400).
Almost surely, 2223210550051 is an apocalyptic number.
223210550051 is a deficient number, since it is larger than the sum of its proper divisors (7696915549).
223210550051 is an equidigital number, since it uses as much as digits as its factorization.
223210550051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7696915548.
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 223210550051 its reverse (150055012322), we get a palindrome (373265562373).
The spelling of 223210550051 in words is "two hundred twenty-three billion, two hundred ten million, five hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •