Base | Representation |
---|---|
bin | 111101110000100… |
… | …011101000100011 |
3 | 2200012200022120010 |
4 | 331300203220203 |
5 | 4110222422133 |
6 | 250452020003 |
7 | 34451015352 |
oct | 7560435043 |
9 | 2605608503 |
10 | 1036139043 |
11 | 491967665 |
12 | 24b001603 |
13 | 136881534 |
14 | 9b877999 |
15 | 60e6e263 |
hex | 3dc23a23 |
1036139043 has 4 divisors (see below), whose sum is σ = 1381518728. Its totient is φ = 690759360.
The previous prime is 1036139023. The next prime is 1036139047. The reversal of 1036139043 is 3409316301.
1036139043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1036139043 - 212 = 1036134947 is a prime.
It is a super-3 number, since 3×10361390433 (a number of 28 digits) contains 333 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 1036139043.
It is not an unprimeable number, because it can be changed into a prime (1036139047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172689838 + ... + 172689843.
It is an arithmetic number, because the mean of its divisors is an integer number (345379682).
Almost surely, 21036139043 is an apocalyptic number.
1036139043 is a deficient number, since it is larger than the sum of its proper divisors (345379685).
1036139043 is an equidigital number, since it uses as much as digits as its factorization.
1036139043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345379684.
The product of its (nonzero) digits is 5832, while the sum is 30.
The square root of 1036139043 is about 32189.1137343046. The cubic root of 1036139043 is about 1011.9040782894.
The spelling of 1036139043 in words is "one billion, thirty-six million, one hundred thirty-nine thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •