Base | Representation |
---|---|
bin | 111101011110110011111… |
… | …1100001011010011110111 |
3 | 1002220210210011100020000221 |
4 | 1322331213330023103313 |
5 | 2101420441242440242 |
6 | 25545503444115211 |
7 | 1531326334105633 |
oct | 172754774132367 |
9 | 32823704306027 |
10 | 8449944499447 |
11 | 2768668420260 |
12 | b457a5395b07 |
13 | 493a9863c249 |
14 | 212d9da45dc3 |
15 | e9c083de167 |
hex | 7af67f0b4f7 |
8449944499447 has 64 divisors (see below), whose sum is σ = 9907220574720. Its totient is φ = 7121795788800.
The previous prime is 8449944499429. The next prime is 8449944499453. The reversal of 8449944499447 is 7449944499448.
It is not a de Polignac number, because 8449944499447 - 219 = 8449943975159 is a prime.
It is a super-2 number, since 2×84499444994472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8449944499147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10217586648 + ... + 10217587474.
It is an arithmetic number, because the mean of its divisors is an integer number (154800321480).
Almost surely, 28449944499447 is an apocalyptic number.
8449944499447 is a deficient number, since it is larger than the sum of its proper divisors (1457276075273).
8449944499447 is a wasteful number, since it uses less digits than its factorization.
8449944499447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2512.
The product of its digits is 6019743744, while the sum is 79.
Subtracting from 8449944499447 its reverse (7449944499448), we obtain a palindrome (999999999999).
The spelling of 8449944499447 in words is "eight trillion, four hundred forty-nine billion, nine hundred forty-four million, four hundred ninety-nine thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •