Base | Representation |
---|---|
bin | 101000000010… |
… | …011011111100 |
3 | 201202020110010 |
4 | 220002123330 |
5 | 10141330430 |
6 | 1012543220 |
7 | 155132553 |
oct | 50023374 |
9 | 21666403 |
10 | 10495740 |
11 | 5a19672 |
12 | 3621b10 |
13 | 22363c8 |
14 | 1572d9a |
15 | dc4cb0 |
hex | a026fc |
10495740 has 24 divisors (see below), whose sum is σ = 29388240. Its totient is φ = 2798848.
The previous prime is 10495739. The next prime is 10495769. The reversal of 10495740 is 4759401.
It is a happy number.
It is a super-2 number, since 2×104957402 = 220321116295200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 10495698 and 10495707.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 87405 + ... + 87524.
It is an arithmetic number, because the mean of its divisors is an integer number (1224510).
Almost surely, 210495740 is an apocalyptic number.
10495740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10495740 is an abundant number, since it is smaller than the sum of its proper divisors (18892500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10495740 is a wasteful number, since it uses less digits than its factorization.
10495740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174941 (or 174939 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 10495740 is about 3239.7129502473. The cubic root of 10495740 is about 218.9463390972.
The spelling of 10495740 in words is "ten million, four hundred ninety-five thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •