Base | Representation |
---|---|
bin | 1000010101100000001… |
… | …0101001011111100101 |
3 | 111200122121210002102021 |
4 | 2011120002221133211 |
5 | 4321244004310041 |
6 | 145442404543141 |
7 | 13226621333362 |
oct | 2053002513745 |
9 | 450577702367 |
10 | 143211010021 |
11 | 5580a977532 |
12 | 239090b1ab1 |
13 | 10673bb7021 |
14 | 6d07c81469 |
15 | 3ad2a96cd1 |
hex | 21580a97e5 |
143211010021 has 2 divisors, whose sum is σ = 143211010022. Its totient is φ = 143211010020.
The previous prime is 143211009979. The next prime is 143211010051. The reversal of 143211010021 is 120010112341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78840216225 + 64370793796 = 280785^2 + 253714^2 .
It is a cyclic number.
It is not a de Polignac number, because 143211010021 - 29 = 143211009509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143211009977 and 143211010004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143211010051) by changing a digit.
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 as a sum of consecutive naturals, namely, 71605505010 + 71605505011.
It is an arithmetic number, because the mean of its divisors is an integer number (71605505011).
Almost surely, 2143211010021 is an apocalyptic number.
It is an amenable number.
143211010021 is a deficient number, since it is larger than the sum of its proper divisors (1).
143211010021 is an equidigital number, since it uses as much as digits as its factorization.
143211010021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 143211010021 its reverse (120010112341), we get a palindrome (263221122362).
The spelling of 143211010021 in words is "one hundred forty-three billion, two hundred eleven million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •