Base | Representation |
---|---|
bin | 100000101010100111000011… |
… | …110100100110111011110101 |
3 | 200211200022010220201010211110 |
4 | 200222213003310212323311 |
5 | 122312304220441310424 |
6 | 1225315030431425233 |
7 | 42155333434616553 |
oct | 4052470364467365 |
9 | 624608126633743 |
10 | 143665646431989 |
11 | 4185a2930674a0 |
12 | 14143446385219 |
13 | 62217c638b7a6 |
14 | 2769650bb0bd3 |
15 | 1192116d97c29 |
hex | 82a9c3d26ef5 |
143665646431989 has 16 divisors (see below), whose sum is σ = 210817489218624. Its totient is φ = 86299556985600.
The previous prime is 143665646431981. The next prime is 143665646432059. The reversal of 143665646431989 is 989134646566341.
It is not a de Polignac number, because 143665646431989 - 23 = 143665646431981 is a prime.
It is a super-2 number, since 2×1436656464319892 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 143665646431989.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143665646431981) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19263290242 + ... + 19263297699.
It is an arithmetic number, because the mean of its divisors is an integer number (13176093076164).
Almost surely, 2143665646431989 is an apocalyptic number.
It is an amenable number.
143665646431989 is a deficient number, since it is larger than the sum of its proper divisors (67151842786635).
143665646431989 is a wasteful number, since it uses less digits than its factorization.
143665646431989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38526588068.
The product of its digits is 2418647040, while the sum is 75.
The spelling of 143665646431989 in words is "one hundred forty-three trillion, six hundred sixty-five billion, six hundred forty-six million, four hundred thirty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •