Base | Representation |
---|---|
bin | 1100001011010… |
… | …11111110011101 |
3 | 21010012222010201 |
4 | 12011223332131 |
5 | 202122413031 |
6 | 14045303501 |
7 | 2350203325 |
oct | 605537635 |
9 | 233188121 |
10 | 102154141 |
11 | 52732a11 |
12 | 2a264b91 |
13 | 1821914b |
14 | d7d2285 |
15 | 8e7cd61 |
hex | 616bf9d |
102154141 has 4 divisors (see below), whose sum is σ = 102251484. Its totient is φ = 102056800.
The previous prime is 102154133. The next prime is 102154223. The reversal of 102154141 is 141451201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141451201 = 173 ⋅817637.
It can be written as a sum of positive squares in 2 ways, for example, as 57062916 + 45091225 = 7554^2 + 6715^2 .
It is a cyclic number.
It is not a de Polignac number, because 102154141 - 23 = 102154133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102154441) 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 3 ways as a sum of consecutive naturals, for example, 47080 + ... + 49201.
It is an arithmetic number, because the mean of its divisors is an integer number (25562871).
Almost surely, 2102154141 is an apocalyptic number.
It is an amenable number.
102154141 is a deficient number, since it is larger than the sum of its proper divisors (97343).
102154141 is an equidigital number, since it uses as much as digits as its factorization.
102154141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97342.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 102154141 is about 10107.1331741498. The cubic root of 102154141 is about 467.4681130129.
The spelling of 102154141 in words is "one hundred two million, one hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •