Base | Representation |
---|---|
bin | 100110101110… |
… | …001001010010 |
3 | 201002200211210 |
4 | 212232021102 |
5 | 10044303412 |
6 | 1001320550 |
7 | 152164146 |
oct | 46561122 |
9 | 21080753 |
10 | 10150482 |
11 | 5803231 |
12 | 3496156 |
13 | 2145204 |
14 | 14c3226 |
15 | d5783c |
hex | 9ae252 |
10150482 has 8 divisors (see below), whose sum is σ = 20300976. Its totient is φ = 3383492.
The previous prime is 10150477. The next prime is 10150487. The reversal of 10150482 is 28405101.
It is an interprime number because it is at equal distance from previous prime (10150477) and next prime (10150487).
It is a sphenic number, since it is the product of 3 distinct primes.
10150482 is an admirable number.
It is a super-3 number, since 3×101504823 (a number of 22 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10150487) 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, 845868 + ... + 845879.
It is an arithmetic number, because the mean of its divisors is an integer number (2537622).
Almost surely, 210150482 is an apocalyptic number.
10150482 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10150482 is a wasteful number, since it uses less digits than its factorization.
10150482 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691752.
The product of its (nonzero) digits is 320, while the sum is 21.
The square root of 10150482 is about 3185.9821091776. The cubic root of 10150482 is about 216.5187719181.
Adding to 10150482 its reverse (28405101), we get a palindrome (38555583).
The spelling of 10150482 in words is "ten million, one hundred fifty thousand, four hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •