Base | Representation |
---|---|
bin | 1100001101101… |
… | …00111110010101 |
3 | 21010210011021210 |
4 | 12012310332111 |
5 | 202212000031 |
6 | 14055532033 |
7 | 2352560130 |
oct | 606647625 |
9 | 233704253 |
10 | 102453141 |
11 | 5291761a |
12 | 2a38a019 |
13 | 182c227b |
14 | d86d217 |
15 | 8edb746 |
hex | 61b4f95 |
102453141 has 8 divisors (see below), whose sum is σ = 156119104. Its totient is φ = 58544640.
The previous prime is 102453107. The next prime is 102453157. The reversal of 102453141 is 141354201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102453141 - 26 = 102453077 is a prime.
It is a super-2 number, since 2×1024531412 = 20993292201531762, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4878721 = 102453141 / (1 + 0 + 2 + 4 + 5 + 3 + 1 + 4 + 1).
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 (102453341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2439340 + ... + 2439381.
It is an arithmetic number, because the mean of its divisors is an integer number (19514888).
Almost surely, 2102453141 is an apocalyptic number.
It is an amenable number.
102453141 is a deficient number, since it is larger than the sum of its proper divisors (53665963).
102453141 is an equidigital number, since it uses as much as digits as its factorization.
102453141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4878731.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 102453141 is about 10121.9139000487. The cubic root of 102453141 is about 467.9237539240.
The spelling of 102453141 in words is "one hundred two million, four hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •