Base | Representation |
---|---|
bin | 111100001001110… |
… | …001111111111100 |
3 | 2121022222112002121 |
4 | 330021301333330 |
5 | 4031323301202 |
6 | 244050332324 |
7 | 34003014313 |
oct | 7411617774 |
9 | 2538875077 |
10 | 1009197052 |
11 | 478735756 |
12 | 241b8a0a4 |
13 | 13110a426 |
14 | 9806327a |
15 | 5d8eb537 |
hex | 3c271ffc |
1009197052 has 12 divisors (see below), whose sum is σ = 1813827400. Its totient is φ = 490960656.
The previous prime is 1009197047. The next prime is 1009197067. The reversal of 1009197052 is 2507919001.
It is a junction number, because it is equal to n+sod(n) for n = 1009196999 and 1009197017.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3409302 + ... + 3409597.
Almost surely, 21009197052 is an apocalyptic number.
It is an amenable number.
1009197052 is a deficient number, since it is larger than the sum of its proper divisors (804630348).
1009197052 is a wasteful number, since it uses less digits than its factorization.
1009197052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6818940 (or 6818938 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 34.
The square root of 1009197052 is about 31767.8619362399. The cubic root of 1009197052 is about 1003.0563333101.
The spelling of 1009197052 in words is "one billion, nine million, one hundred ninety-seven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •