Base | Representation |
---|---|
bin | 101011001001110… |
… | …1000111110010011 |
3 | 10201220122110200101 |
4 | 1112103220332103 |
5 | 10431141123024 |
6 | 355403233231 |
7 | 50611463452 |
oct | 12623507623 |
9 | 3656573611 |
10 | 1447989139 |
11 | 683396743 |
12 | 344b18817 |
13 | 1a0cb180c |
14 | da444b99 |
15 | 871c3c44 |
hex | 564e8f93 |
1447989139 has 8 divisors (see below), whose sum is σ = 1454357520. Its totient is φ = 1441632096.
The previous prime is 1447989121. The next prime is 1447989167. The reversal of 1447989139 is 9319897441.
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 1447989139 - 217 = 1447858067 is a prime.
It is a super-2 number, since 2×14479891392 = 4193345093323922642, 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 1447989139.
It is not an unprimeable number, because it can be changed into a prime (1447989239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 338337 + ... + 342589.
It is an arithmetic number, because the mean of its divisors is an integer number (181794690).
Almost surely, 21447989139 is an apocalyptic number.
1447989139 is a deficient number, since it is larger than the sum of its proper divisors (6368381).
1447989139 is a wasteful number, since it uses less digits than its factorization.
1447989139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5669.
The product of its digits is 1959552, while the sum is 55.
The square root of 1447989139 is about 38052.4524702417. The cubic root of 1447989139 is about 1131.3277365707.
The spelling of 1447989139 in words is "one billion, four hundred forty-seven million, nine hundred eighty-nine thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •