Base | Representation |
---|---|
bin | 1000010100110011111… |
… | …1001011010010000111 |
3 | 111200011200210202202001 |
4 | 2011030333023102013 |
5 | 4320404020103341 |
6 | 145412141530131 |
7 | 13222210056106 |
oct | 2051477132207 |
9 | 450150722661 |
10 | 143025550471 |
11 | 55725215a81 |
12 | 23876b73947 |
13 | 1064465114b |
14 | 6ccb3a603d |
15 | 3ac1660d31 |
hex | 214cfcb487 |
143025550471 has 2 divisors, whose sum is σ = 143025550472. Its totient is φ = 143025550470.
The previous prime is 143025550403. The next prime is 143025550477. The reversal of 143025550471 is 174055520341.
143025550471 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 143025550471 - 229 = 142488679559 is a prime.
It is a super-3 number, since 3×1430255504713 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 143025550471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143025550477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71512775235 + 71512775236.
It is an arithmetic number, because the mean of its divisors is an integer number (71512775236).
Almost surely, 2143025550471 is an apocalyptic number.
143025550471 is a deficient number, since it is larger than the sum of its proper divisors (1).
143025550471 is an equidigital number, since it uses as much as digits as its factorization.
143025550471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84000, while the sum is 37.
The spelling of 143025550471 in words is "one hundred forty-three billion, twenty-five million, five hundred fifty thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •