Base | Representation |
---|---|
bin | 101100011001110… |
… | …1000011100001101 |
3 | 10211211120021201111 |
4 | 1120303220130031 |
5 | 11022410224442 |
6 | 403502212021 |
7 | 51631124143 |
oct | 13063503415 |
9 | 3754507644 |
10 | 1489929997 |
11 | 6a5032506 |
12 | 356b84011 |
13 | 1a98a78aa |
14 | 101c41593 |
15 | 8ac0ab17 |
hex | 58ce870d |
1489929997 has 8 divisors (see below), whose sum is σ = 1578169656. Its totient is φ = 1401756672.
The previous prime is 1489929983. The next prime is 1489930003. The reversal of 1489929997 is 7999299841.
It can be written as a sum of positive squares in 4 ways, for example, as 486687721 + 1003242276 = 22061^2 + 31674^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1489929997 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 (1489929907) 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, 34123 + ... + 64375.
It is an arithmetic number, because the mean of its divisors is an integer number (197271207).
Almost surely, 21489929997 is an apocalyptic number.
1489929997 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1489929997 is a deficient number, since it is larger than the sum of its proper divisors (88239659).
1489929997 is a wasteful number, since it uses less digits than its factorization.
1489929997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33167.
The product of its digits is 26453952, while the sum is 67.
The square root of 1489929997 is about 38599.6113581471. The cubic root of 1489929997 is about 1142.1468718897.
The spelling of 1489929997 in words is "one billion, four hundred eighty-nine million, nine hundred twenty-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •