Base | Representation |
---|---|
bin | 10011001100000111… |
… | …11001011010101001 |
3 | 222120222110121210210 |
4 | 21212003321122221 |
5 | 132044332412413 |
6 | 4422140331333 |
7 | 513204346326 |
oct | 114603713251 |
9 | 28528417723 |
10 | 10302232233 |
11 | 4407383617 |
12 | 1bb6243b49 |
13 | c824ba307 |
14 | 6da357b4d |
15 | 4046ad3c3 |
hex | 2660f96a9 |
10302232233 has 24 divisors (see below), whose sum is σ = 14343199104. Its totient is φ = 6572715840.
The previous prime is 10302232229. The next prime is 10302232279. The reversal of 10302232233 is 33223220301.
10302232233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10302232233 - 22 = 10302232229 is a prime.
It is a super-2 number, since 2×103022322332 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10302232333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 400560 + ... + 425502.
It is an arithmetic number, because the mean of its divisors is an integer number (597633296).
Almost surely, 210302232233 is an apocalyptic number.
It is an amenable number.
10302232233 is a deficient number, since it is larger than the sum of its proper divisors (4040966871).
10302232233 is an equidigital number, since it uses as much as digits as its factorization.
10302232233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25105 (or 25044 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 10302232233 its reverse (33223220301), we get a palindrome (43525452534).
The spelling of 10302232233 in words is "ten billion, three hundred two million, two hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •