Base | Representation |
---|---|
bin | 1100001010010… |
… | …11010010001001 |
3 | 21002222011110011 |
4 | 12011023102021 |
5 | 202104121413 |
6 | 14042351521 |
7 | 2346105040 |
oct | 605132211 |
9 | 232864404 |
10 | 102020233 |
11 | 52651347 |
12 | 2a1bb5a1 |
13 | 181a0203 |
14 | d799557 |
15 | 8e5333d |
hex | 614b489 |
102020233 has 8 divisors (see below), whose sum is σ = 117311168. Its totient is φ = 86908464.
The previous prime is 102020227. The next prime is 102020239. The reversal of 102020233 is 332020201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102020227) and next prime (102020239).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102020233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102020239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43566 + ... + 45847.
It is an arithmetic number, because the mean of its divisors is an integer number (14663896).
Almost surely, 2102020233 is an apocalyptic number.
It is an amenable number.
102020233 is a deficient number, since it is larger than the sum of its proper divisors (15290935).
102020233 is an equidigital number, since it uses as much as digits as its factorization.
102020233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89583.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 102020233 is about 10100.5065714547. The cubic root of 102020233 is about 467.2637646581.
Adding to 102020233 its reverse (332020201), we get a palindrome (434040434).
The spelling of 102020233 in words is "one hundred two million, twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •