Base | Representation |
---|---|
bin | 111101111011110… |
… | …111101111011111 |
3 | 2200102021000002001 |
4 | 331323313233133 |
5 | 4112002324431 |
6 | 251035343131 |
7 | 34515150421 |
oct | 7573675737 |
9 | 2612230061 |
10 | 1039104991 |
11 | 493602a61 |
12 | 24bbb1aa7 |
13 | 13737c532 |
14 | 9c00a811 |
15 | 61357e61 |
hex | 3def7bdf |
1039104991 has 24 divisors (see below), whose sum is σ = 1132830000. Its totient is φ = 952617984.
The previous prime is 1039104977. The next prime is 1039105007. The reversal of 1039104991 is 1994019301.
It is not a de Polignac number, because 1039104991 - 27 = 1039104863 is a prime.
It is a super-2 number, since 2×10391049912 = 2159478364642220162, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1039104991.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1039104931) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2540395 + ... + 2540803.
It is an arithmetic number, because the mean of its divisors is an integer number (47201250).
Almost surely, 21039104991 is an apocalyptic number.
1039104991 is a deficient number, since it is larger than the sum of its proper divisors (93725009).
1039104991 is a wasteful number, since it uses less digits than its factorization.
1039104991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651 (or 634 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 37.
The square root of 1039104991 is about 32235.1514809532. The cubic root of 1039104991 is about 1012.8686836177.
It can be divided in two parts, 1039 and 104991, that added together give a triangular number (106030 = T460).
The spelling of 1039104991 in words is "one billion, thirty-nine million, one hundred four thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •