Base | Representation |
---|---|
bin | 10011000010100011… |
… | …10110010000100001 |
3 | 222101101111120022100 |
4 | 21201101312100201 |
5 | 131413313100413 |
6 | 4410153001013 |
7 | 511211410461 |
oct | 114121662041 |
9 | 28341446270 |
10 | 10222003233 |
11 | 4376066362 |
12 | 1b933b3169 |
13 | c6b9a9930 |
14 | 6cd831ba1 |
15 | 3ec611a73 |
hex | 261476421 |
10222003233 has 24 divisors (see below), whose sum is σ = 15904423080. Its totient is φ = 6289067520.
The previous prime is 10222003223. The next prime is 10222003277. The reversal of 10222003233 is 33230022201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 244390689 + 9977612544 = 15633^2 + 99888^2 .
It is not a de Polignac number, because 10222003233 - 28 = 10222002977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10222003213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 827023 + ... + 839291.
It is an arithmetic number, because the mean of its divisors is an integer number (662684295).
Almost surely, 210222003233 is an apocalyptic number.
10222003233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10222003233 is a deficient number, since it is larger than the sum of its proper divisors (5682419847).
10222003233 is a wasteful number, since it uses less digits than its factorization.
10222003233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19409 (or 19406 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 10222003233 its reverse (33230022201), we get a palindrome (43452025434).
The spelling of 10222003233 in words is "ten billion, two hundred twenty-two million, three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •