Base | Representation |
---|---|
bin | 1100111111001111001… |
… | …0000111001000101101 |
3 | 210022221112201201012222 |
4 | 3033303302013020231 |
5 | 12123434113111023 |
6 | 250301145405125 |
7 | 22056311012444 |
oct | 3176362071055 |
9 | 708845651188 |
10 | 223133332013 |
11 | 866a2a48a09 |
12 | 372b2a997a5 |
13 | 1806cbc2607 |
14 | ab2a599d5b |
15 | 5c0e31ecc8 |
hex | 33f3c8722d |
223133332013 has 8 divisors (see below), whose sum is σ = 228798364032. Its totient is φ = 217536967296.
The previous prime is 223133331931. The next prime is 223133332043. The reversal of 223133332013 is 310233331322.
It is a happy number.
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 223133332013 - 210 = 223133330989 is a prime.
It is a super-3 number, since 3×2231333320133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223133332043) 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, 17160245 + ... + 17173242.
It is an arithmetic number, because the mean of its divisors is an integer number (28599795504).
Almost surely, 2223133332013 is an apocalyptic number.
It is an amenable number.
223133332013 is a deficient number, since it is larger than the sum of its proper divisors (5665032019).
223133332013 is an equidigital number, since it uses as much as digits as its factorization.
223133332013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34333651.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 223133332013 its reverse (310233331322), we get a palindrome (533366663335).
The spelling of 223133332013 in words is "two hundred twenty-three billion, one hundred thirty-three million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •