Base | Representation |
---|---|
bin | 100000100100010011100101… |
… | …110001111011111101001001 |
3 | 200210010212220221010201221112 |
4 | 200210103211301323331021 |
5 | 122233210001130210410 |
6 | 1224344022321220105 |
7 | 42112126000615631 |
oct | 4044234561737511 |
9 | 623125827121845 |
10 | 143232424460105 |
11 | 41702591600992 |
12 | 140934a1191635 |
13 | 61bc9b4cc5a26 |
14 | 27526b46d96c1 |
15 | 1185c0da87105 |
hex | 8244e5c7bf49 |
143232424460105 has 32 divisors (see below), whose sum is σ = 182309786588160. Its totient is φ = 107724361268160.
The previous prime is 143232424460089. The next prime is 143232424460117. The reversal of 143232424460105 is 501064424232341.
143232424460105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 143232424460105 - 24 = 143232424460089 is a prime.
It is a super-2 number, since 2×1432324244601052 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1033450622 + ... + 1033589208.
It is an arithmetic number, because the mean of its divisors is an integer number (5697180830880).
Almost surely, 2143232424460105 is an apocalyptic number.
It is an amenable number.
143232424460105 is a deficient number, since it is larger than the sum of its proper divisors (39077362128055).
143232424460105 is a wasteful number, since it uses less digits than its factorization.
143232424460105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221789.
The product of its (nonzero) digits is 552960, while the sum is 41.
Adding to 143232424460105 its reverse (501064424232341), we get a palindrome (644296848692446).
The spelling of 143232424460105 in words is "one hundred forty-three trillion, two hundred thirty-two billion, four hundred twenty-four million, four hundred sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •