Base | Representation |
---|---|
bin | 111011110110011010100 |
3 | 10200122020000 |
4 | 13132303110 |
5 | 1000224142 |
6 | 110011300 |
7 | 22445463 |
oct | 7366324 |
9 | 3618200 |
10 | 1961172 |
11 | 111a504 |
12 | 7a6b30 |
13 | 538875 |
14 | 3909da |
15 | 28b14c |
hex | 1decd4 |
1961172 has 30 divisors (see below), whose sum is σ = 5127738. Its totient is φ = 653616.
The previous prime is 1961147. The next prime is 1961173. The reversal of 1961172 is 2711691.
It can be written as a sum of positive squares in only one way, i.e., 1245456 + 715716 = 1116^2 + 846^2 .
It is a super-2 number, since 2×19611722 = 7692391227168, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1961173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2703 + ... + 3350.
21961172 is an apocalyptic number.
1961172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1961172 is an abundant number, since it is smaller than the sum of its proper divisors (3166566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1961172 is a wasteful number, since it uses less digits than its factorization.
1961172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6069 (or 6058 counting only the distinct ones).
The product of its digits is 756, while the sum is 27.
The square root of 1961172 is about 1400.4185088751. The cubic root of 1961172 is about 125.1714341086.
It can be divided in two parts, 19611 and 72, that added together give a 9-th power (19683 = 39).
The spelling of 1961172 in words is "one million, nine hundred sixty-one thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •