Base | Representation |
---|---|
bin | 100100100010010… |
… | …1111100100100100 |
3 | 10011102220020122221 |
4 | 1021010233210210 |
5 | 10002322331241 |
6 | 321353002124 |
7 | 42244442200 |
oct | 11104574444 |
9 | 3142806587 |
10 | 1225980196 |
11 | 57a041081 |
12 | 2a26b3344 |
13 | 166cbc88c |
14 | b8b73b00 |
15 | 7296d5d1 |
hex | 4912f924 |
1225980196 has 81 divisors (see below), whose sum is σ = 2600725491. Its totient is φ = 504201600.
The previous prime is 1225980167. The next prime is 1225980199. The reversal of 1225980196 is 6910895221.
The square root of 1225980196 is 35014.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1037741796 + 188238400 = 32214^2 + 13720^2 .
It is not an unprimeable number, because it can be changed into a prime (1225980199) 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 26 ways as a sum of consecutive naturals, for example, 20098006 + ... + 20098066.
Almost surely, 21225980196 is an apocalyptic number.
1225980196 is the 35014-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1225980196
1225980196 is an abundant number, since it is smaller than the sum of its proper divisors (1374745295).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1225980196 is an equidigital number, since it uses as much as digits as its factorization.
1225980196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 43.
The cubic root of 1225980196 is about 1070.2727915413.
The spelling of 1225980196 in words is "one billion, two hundred twenty-five million, nine hundred eighty thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •