Base | Representation |
---|---|
bin | 111101101000001001010… |
… | …1111010110101001100101 |
3 | 1002222201112011022122102021 |
4 | 1323100102233112221211 |
5 | 2102233014404124031 |
6 | 30003020514543141 |
7 | 1532636150230303 |
oct | 173202257265145 |
9 | 32881464278367 |
10 | 8469989911141 |
11 | 2776114546800 |
12 | b4965a597ab1 |
13 | 4959415569b5 |
14 | 213d41d8d273 |
15 | ea4cd12a511 |
hex | 7b412bd6a65 |
8469989911141 has 12 divisors (see below), whose sum is σ = 9320119597600. Its totient is φ = 7691612064840.
The previous prime is 8469989911111. The next prime is 8469989911153. The reversal of 8469989911141 is 1411199899648.
It is not a de Polignac number, because 8469989911141 - 27 = 8469989911013 is a prime.
It is a super-3 number, since 3×84699899111413 (a number of 40 digits) contains 333 as substring.
It is a hoax number, since the sum of its digits (70) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8469989911111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 37973631 + ... + 38196028.
Almost surely, 28469989911141 is an apocalyptic number.
It is an amenable number.
8469989911141 is a deficient number, since it is larger than the sum of its proper divisors (850129686459).
8469989911141 is a wasteful number, since it uses less digits than its factorization.
8469989911141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76170600 (or 76170589 counting only the distinct ones).
The product of its digits is 40310784, while the sum is 70.
The spelling of 8469989911141 in words is "eight trillion, four hundred sixty-nine billion, nine hundred eighty-nine million, nine hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •