Base | Representation |
---|---|
bin | 1000010101001010101… |
… | …1011101110000011000 |
3 | 111200102100111110201221 |
4 | 2011102223131300120 |
5 | 4321102441442202 |
6 | 145425432421424 |
7 | 13224446552251 |
oct | 2052253356030 |
9 | 450370443657 |
10 | 143121046552 |
11 | 55774110660 |
12 | 238a2b47874 |
13 | 1065b3788c3 |
14 | 6cd9d43b28 |
15 | 3ac9c26037 |
hex | 2152addc18 |
143121046552 has 32 divisors (see below), whose sum is σ = 292800453120. Its totient is φ = 65043275040.
The previous prime is 143121046517. The next prime is 143121046571. The reversal of 143121046552 is 255640121341.
It is a super-2 number, since 2×1431210465522 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 352933 + ... + 640939.
It is an arithmetic number, because the mean of its divisors is an integer number (9150014160).
Almost surely, 2143121046552 is an apocalyptic number.
It is an amenable number.
143121046552 is an abundant number, since it is smaller than the sum of its proper divisors (149679406568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143121046552 is a wasteful number, since it uses less digits than its factorization.
143121046552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293671 (or 293667 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 143121046552 its reverse (255640121341), we get a palindrome (398761167893).
It can be divided in two parts, 14312104 and 6552, that added together give a square (14318656 = 37842).
The spelling of 143121046552 in words is "one hundred forty-three billion, one hundred twenty-one million, forty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •