Base | Representation |
---|---|
bin | 1000010101000111101… |
… | …0100010010010000101 |
3 | 111200101110100211001211 |
4 | 2011101322202102011 |
5 | 4321041201020122 |
6 | 145424253451421 |
7 | 13224232541206 |
oct | 2052172422205 |
9 | 450343324054 |
10 | 143108220037 |
11 | 5576794a932 |
12 | 2389a7a0b71 |
13 | 10658807653 |
14 | 6cd83655ad |
15 | 3ac8a40877 |
hex | 2151ea2485 |
143108220037 has 2 divisors, whose sum is σ = 143108220038. Its totient is φ = 143108220036.
The previous prime is 143108220023. The next prime is 143108220041. The reversal of 143108220037 is 730022801341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83867580801 + 59240639236 = 289599^2 + 243394^2 .
It is a cyclic number.
It is not a de Polignac number, because 143108220037 - 215 = 143108187269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143108219990 and 143108220008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143108220007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71554110018 + 71554110019.
It is an arithmetic number, because the mean of its divisors is an integer number (71554110019).
Almost surely, 2143108220037 is an apocalyptic number.
It is an amenable number.
143108220037 is a deficient number, since it is larger than the sum of its proper divisors (1).
143108220037 is an equidigital number, since it uses as much as digits as its factorization.
143108220037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
The spelling of 143108220037 in words is "one hundred forty-three billion, one hundred eight million, two hundred twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •