Base | Representation |
---|---|
bin | 100000100010110001000010… |
… | …111001110100101011110001 |
3 | 200202202202210201111122022210 |
4 | 200202301002321310223301 |
5 | 122224441300313014121 |
6 | 1224223242542322333 |
7 | 42101361613101063 |
oct | 4042610271645361 |
9 | 622682721448283 |
10 | 143126612626161 |
11 | 41671723584a3a |
12 | 14076a90b893a9 |
13 | 61b2a213c02b8 |
14 | 274b51784b733 |
15 | 11830b94d2876 |
hex | 822c42e74af1 |
143126612626161 has 12 divisors (see below), whose sum is σ = 195376728113808. Its totient is φ = 93198724497144.
The previous prime is 143126612626141. The next prime is 143126612626199. The reversal of 143126612626161 is 161626216621341.
It is not a de Polignac number, because 143126612626161 - 219 = 143126612101873 is a prime.
It is a super-3 number, since 3×1431266126261613 (a number of 43 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 143126612626161.
It is not an unprimeable number, because it can be changed into a prime (143126612626141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12901257535 + ... + 12901268628.
It is an arithmetic number, because the mean of its divisors is an integer number (16281394009484).
Almost surely, 2143126612626161 is an apocalyptic number.
It is an amenable number.
143126612626161 is a deficient number, since it is larger than the sum of its proper divisors (52250115487647).
143126612626161 is an equidigital number, since it uses as much as digits as its factorization.
143126612626161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25802526252 (or 25802526209 counting only the distinct ones).
The product of its digits is 746496, while the sum is 48.
The spelling of 143126612626161 in words is "one hundred forty-three trillion, one hundred twenty-six billion, six hundred twelve million, six hundred twenty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •