Base | Representation |
---|---|
bin | 100001111101011… |
… | …0010010000110101 |
3 | 2221102010202210001 |
4 | 1003322302100311 |
5 | 4313201434301 |
6 | 305023031301 |
7 | 40144310626 |
oct | 10372622065 |
9 | 2842122701 |
10 | 1139483701 |
11 | 535232a74 |
12 | 27973b531 |
13 | 1520c6515 |
14 | ab499a4d |
15 | 6a084c01 |
hex | 43eb2435 |
1139483701 has 8 divisors (see below), whose sum is σ = 1207479960. Its totient is φ = 1071595008.
The previous prime is 1139483693. The next prime is 1139483707. The reversal of 1139483701 is 1073849311.
It can be written as a sum of positive squares in 4 ways, for example, as 203062500 + 936421201 = 14250^2 + 30601^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1139483701 - 23 = 1139483693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1139483707) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4536 + ... + 47953.
It is an arithmetic number, because the mean of its divisors is an integer number (150934995).
Almost surely, 21139483701 is an apocalyptic number.
It is an amenable number.
1139483701 is a deficient number, since it is larger than the sum of its proper divisors (67996259).
1139483701 is a wasteful number, since it uses less digits than its factorization.
1139483701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53783.
The product of its (nonzero) digits is 18144, while the sum is 37.
The square root of 1139483701 is about 33756.2394380654. The cubic root of 1139483701 is about 1044.4861987352.
It can be divided in two parts, 113948 and 3701, that added together give a 6-th power (117649 = 76).
The spelling of 1139483701 in words is "one billion, one hundred thirty-nine million, four hundred eighty-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •