Base | Representation |
---|---|
bin | 100000100000111110010010… |
… | …110111000000011000000010 |
3 | 200202022222202211020101111100 |
4 | 200200332102313000120002 |
5 | 122220431430400411224 |
6 | 1224050504404355230 |
7 | 42056440364134341 |
oct | 4040762267003002 |
9 | 622288684211440 |
10 | 143003400013314 |
11 | 41624446242285 |
12 | 140570253a5b16 |
13 | 61a421676c4a9 |
14 | 2745589995b58 |
15 | 117eca748bac9 |
hex | 820f92dc0602 |
143003400013314 has 12 divisors (see below), whose sum is σ = 309840700028886. Its totient is φ = 47667800004432.
The previous prime is 143003400013297. The next prime is 143003400013421. The reversal of 143003400013314 is 413310004300341.
143003400013314 is a `hidden beast` number, since 1 + 4 + 3 + 0 + 0 + 340 + 0 + 0 + 1 + 3 + 314 = 666.
It can be written as a sum of positive squares in only one way, i.e., 82498073294025 + 60505326719289 = 9082845^2 + 7778517^2 .
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 3972316667019 + ... + 3972316667054.
Almost surely, 2143003400013314 is an apocalyptic number.
143003400013314 is an abundant number, since it is smaller than the sum of its proper divisors (166837300015572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143003400013314 is a wasteful number, since it uses less digits than its factorization.
143003400013314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7944633334081 (or 7944633334078 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 143003400013314 its reverse (413310004300341), we get a palindrome (556313404313655).
The spelling of 143003400013314 in words is "one hundred forty-three trillion, three billion, four hundred million, thirteen thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •