Base | Representation |
---|---|
bin | 111110000011111… |
… | …000011110000010 |
3 | 2200120012200220200 |
4 | 332003320132002 |
5 | 4113022030442 |
6 | 251152350030 |
7 | 34542045306 |
oct | 7603703602 |
9 | 2616180820 |
10 | 1041205122 |
11 | 494807901 |
12 | 250845316 |
13 | 137936409 |
14 | 9c3d5d06 |
15 | 6162034c |
hex | 3e0f8782 |
1041205122 has 24 divisors (see below), whose sum is σ = 2328718080. Its totient is φ = 335872440.
The previous prime is 1041205027. The next prime is 1041205129. The reversal of 1041205122 is 2215021401.
1041205122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1041205095 and 1041205104.
It is not an unprimeable number, because it can be changed into a prime (1041205129) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 932422 + ... + 933537.
It is an arithmetic number, because the mean of its divisors is an integer number (97029920).
Almost surely, 21041205122 is an apocalyptic number.
1041205122 is an abundant number, since it is smaller than the sum of its proper divisors (1287512958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1041205122 is a wasteful number, since it uses less digits than its factorization.
1041205122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1865998 (or 1865995 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 1041205122 is about 32267.7102069546. The cubic root of 1041205122 is about 1013.5505927234.
Adding to 1041205122 its reverse (2215021401), we get a palindrome (3256226523).
The spelling of 1041205122 in words is "one billion, forty-one million, two hundred five thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •