Base | Representation |
---|---|
bin | 111100010001110… |
… | …100011001101001 |
3 | 2121110221120100020 |
4 | 330101310121221 |
5 | 4032343212131 |
6 | 244203431053 |
7 | 34026641166 |
oct | 7421643151 |
9 | 2543846306 |
10 | 1011304041 |
11 | 479944770 |
12 | 242825489 |
13 | 131697477 |
14 | 9845106d |
15 | 5dbb5996 |
hex | 3c474669 |
1011304041 has 32 divisors (see below), whose sum is σ = 1607786496. Its totient is φ = 558240000.
The previous prime is 1011304033. The next prime is 1011304079. The reversal of 1011304041 is 1404031101.
1011304041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1011304041 - 23 = 1011304033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1011304041.
It is not an unprimeable number, because it can be changed into a prime (1011304001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11685 + ... + 46466.
It is an arithmetic number, because the mean of its divisors is an integer number (50243328).
Almost surely, 21011304041 is an apocalyptic number.
1011304041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1011304041 is a deficient number, since it is larger than the sum of its proper divisors (596482455).
1011304041 is a wasteful number, since it uses less digits than its factorization.
1011304041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58213.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1011304041 is about 31801.0069180207. The cubic root of 1011304041 is about 1003.7539042366.
Adding to 1011304041 its reverse (1404031101), we get a palindrome (2415335142).
The spelling of 1011304041 in words is "one billion, eleven million, three hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •