Base | Representation |
---|---|
bin | 100000100010101110110100… |
… | …010111011111110011110101 |
3 | 200202202112122001201210220021 |
4 | 200202232310113133303311 |
5 | 122224421401120404333 |
6 | 1224222205355205141 |
7 | 42101245424616100 |
oct | 4042566427376365 |
9 | 622675561653807 |
10 | 143124221263093 |
11 | 41670706731524 |
12 | 140765241467b1 |
13 | 61b272cb39975 |
14 | 274b36bdd9737 |
15 | 1182ec95b582d |
hex | 822bb45dfcf5 |
143124221263093 has 6 divisors (see below), whose sum is σ = 166491441061206. Its totient is φ = 122677903939752.
The previous prime is 143124221263061. The next prime is 143124221263099. The reversal of 143124221263093 is 390362122421341.
It can be written as a sum of positive squares in only one way, i.e., 135937924014564 + 7186297248529 = 11659242^2 + 2680727^2 .
It is not a de Polignac number, because 143124221263093 - 25 = 143124221263061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143124221263099) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1460451237330 + ... + 1460451237427.
It is an arithmetic number, because the mean of its divisors is an integer number (27748573510201).
Almost surely, 2143124221263093 is an apocalyptic number.
It is an amenable number.
143124221263093 is a deficient number, since it is larger than the sum of its proper divisors (23367219798113).
143124221263093 is an equidigital number, since it uses as much as digits as its factorization.
143124221263093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920902474771 (or 2920902474764 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 43.
The spelling of 143124221263093 in words is "one hundred forty-three trillion, one hundred twenty-four billion, two hundred twenty-one million, two hundred sixty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •