Base | Representation |
---|---|
bin | 1100001010011… |
… | …00010010010101 |
3 | 21002222101002022 |
4 | 12011030102111 |
5 | 202104234331 |
6 | 14042422525 |
7 | 2346123026 |
oct | 605142225 |
9 | 232871068 |
10 | 102024341 |
11 | 52654441 |
12 | 2a201a45 |
13 | 181a2043 |
14 | d79ac4d |
15 | 8e5467b |
hex | 614c495 |
102024341 has 4 divisors (see below), whose sum is σ = 102084684. Its totient is φ = 101964000.
The previous prime is 102024331. The next prime is 102024353. The reversal of 102024341 is 143420201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13476241 + 88548100 = 3671^2 + 9410^2 .
It is a cyclic number.
It is not a de Polignac number, because 102024341 - 222 = 97830037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102024331) 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, 27560 + ... + 31041.
It is an arithmetic number, because the mean of its divisors is an integer number (25521171).
Almost surely, 2102024341 is an apocalyptic number.
It is an amenable number.
102024341 is a deficient number, since it is larger than the sum of its proper divisors (60343).
102024341 is an equidigital number, since it uses as much as digits as its factorization.
102024341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60342.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 102024341 is about 10100.7099255448. The cubic root of 102024341 is about 467.2700362695.
Adding to 102024341 its reverse (143420201), we get a palindrome (245444542).
The spelling of 102024341 in words is "one hundred two million, twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •