Base | Representation |
---|---|
bin | 1100001010011… |
… | …00100110100001 |
3 | 21002222102212011 |
4 | 12011030212201 |
5 | 202104310013 |
6 | 14042432521 |
7 | 2346126553 |
oct | 605144641 |
9 | 232872764 |
10 | 102025633 |
11 | 52655406 |
12 | 2a202741 |
13 | 181a27c8 |
14 | d79b4d3 |
15 | 8e54c3d |
hex | 614c9a1 |
102025633 has 4 divisors (see below), whose sum is σ = 102304000. Its totient is φ = 101747268.
The previous prime is 102025621. The next prime is 102025661. The reversal of 102025633 is 336520201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 336520201 = 4003 ⋅84067.
It is a cyclic number.
It is not a de Polignac number, because 102025633 - 217 = 101894561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102025333) 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 3 ways as a sum of consecutive naturals, for example, 138633 + ... + 139366.
It is an arithmetic number, because the mean of its divisors is an integer number (25576000).
Almost surely, 2102025633 is an apocalyptic number.
It is an amenable number.
102025633 is a deficient number, since it is larger than the sum of its proper divisors (278367).
102025633 is an equidigital number, since it uses as much as digits as its factorization.
102025633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278366.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 102025633 is about 10100.7738812430. The cubic root of 102025633 is about 467.2720087085.
Adding to 102025633 its reverse (336520201), we get a palindrome (438545834).
The spelling of 102025633 in words is "one hundred two million, twenty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •