Base | Representation |
---|---|
bin | 1000010101010000101… |
… | …0010100010010001101 |
3 | 111200111002021201221121 |
4 | 2011110022110102031 |
5 | 4321130323131222 |
6 | 145432121400541 |
7 | 13225201112524 |
oct | 2052412242215 |
9 | 450432251847 |
10 | 143145911437 |
11 | 55787153a51 |
12 | 238ab339151 |
13 | 10663573459 |
14 | 6cdd3774bb |
15 | 3acbed85c7 |
hex | 215429448d |
143145911437 has 2 divisors, whose sum is σ = 143145911438. Its totient is φ = 143145911436.
The previous prime is 143145911431. The next prime is 143145911443. The reversal of 143145911437 is 734119541341.
It is a balanced prime because it is at equal distance from previous prime (143145911431) and next prime (143145911443).
It can be written as a sum of positive squares in only one way, i.e., 107640423396 + 35505488041 = 328086^2 + 188429^2 .
It is a cyclic number.
It is not a de Polignac number, because 143145911437 - 215 = 143145878669 is a prime.
It is a super-2 number, since 2×1431459114372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 143145911393 and 143145911402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143145911431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71572955718 + 71572955719.
It is an arithmetic number, because the mean of its divisors is an integer number (71572955719).
Almost surely, 2143145911437 is an apocalyptic number.
It is an amenable number.
143145911437 is a deficient number, since it is larger than the sum of its proper divisors (1).
143145911437 is an equidigital number, since it uses as much as digits as its factorization.
143145911437 is an evil number, because the sum of its binary digits is even.
The product of its digits is 181440, while the sum is 43.
The spelling of 143145911437 in words is "one hundred forty-three billion, one hundred forty-five million, nine hundred eleven thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •