Base | Representation |
---|---|
bin | 100000011111110101001… |
… | …011000000100000101111 |
3 | 21220111021122021212022122 |
4 | 200133311023000200233 |
5 | 243042044020031343 |
6 | 4425530222503155 |
7 | 320225545051133 |
oct | 40376513004057 |
9 | 7814248255278 |
10 | 2233201330223 |
11 | 791105a27876 |
12 | 300986734abb |
13 | 132789261776 |
14 | 7a13222d3c3 |
15 | 3d15613d068 |
hex | 207f52c082f |
2233201330223 has 16 divisors (see below), whose sum is σ = 2354590368480. Its totient is φ = 2112198488064.
The previous prime is 2233201330187. The next prime is 2233201330247. The reversal of 2233201330223 is 3220331023322.
It is a cyclic number.
It is not a de Polignac number, because 2233201330223 - 28 = 2233201329967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2233201330192 and 2233201330201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2233201332223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 148743665 + ... + 148758677.
It is an arithmetic number, because the mean of its divisors is an integer number (147161898030).
Almost surely, 22233201330223 is an apocalyptic number.
2233201330223 is a deficient number, since it is larger than the sum of its proper divisors (121389038257).
2233201330223 is a wasteful number, since it uses less digits than its factorization.
2233201330223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27338.
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 2233201330223 its reverse (3220331023322), we get a palindrome (5453532353545).
The spelling of 2233201330223 in words is "two trillion, two hundred thirty-three billion, two hundred one million, three hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •