Base | Representation |
---|---|
bin | 1100001100011… |
… | …01111010000000 |
3 | 21010111000210002 |
4 | 12012031322000 |
5 | 202141334440 |
6 | 14052255132 |
7 | 2351322446 |
oct | 606157200 |
9 | 233430702 |
10 | 102293120 |
11 | 52818376 |
12 | 2a3114a8 |
13 | 18267497 |
14 | d82ab96 |
15 | 8ea9115 |
hex | 618de80 |
102293120 has 32 divisors (see below), whose sum is σ = 244546020. Its totient is φ = 40916992.
The previous prime is 102293117. The next prime is 102293143. The reversal of 102293120 is 21392201.
It can be written as a sum of positive squares in 2 ways, for example, as 84787264 + 17505856 = 9208^2 + 4184^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 102293092 and 102293101.
It is an unprimeable number.
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, 79277 + ... + 80556.
Almost surely, 2102293120 is an apocalyptic number.
102293120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102293120 is an abundant number, since it is smaller than the sum of its proper divisors (142252900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102293120 is an equidigital number, since it uses as much as digits as its factorization.
102293120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159852 (or 159840 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 102293120 is about 10114.0061301148. The cubic root of 102293120 is about 467.6800111299.
The spelling of 102293120 in words is "one hundred two million, two hundred ninety-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •