Base | Representation |
---|---|
bin | 1000010101001101010… |
… | …0001010111110111001 |
3 | 111200110002120121121111 |
4 | 2011103110022332321 |
5 | 4321113204430221 |
6 | 145430453240321 |
7 | 13224636345130 |
oct | 2052324127671 |
9 | 450402517544 |
10 | 143131717561 |
11 | 5577a139978 |
12 | 238a66330a1 |
13 | 10660643a01 |
14 | 6cdb520917 |
15 | 3acab32be1 |
hex | 215350afb9 |
143131717561 has 16 divisors (see below), whose sum is σ = 165535463808. Its totient is φ = 121225104000.
The previous prime is 143131717559. The next prime is 143131717577. The reversal of 143131717561 is 165717131341.
143131717561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 143131717561 - 21 = 143131717559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143131717501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121290 + ... + 548611.
It is an arithmetic number, because the mean of its divisors is an integer number (10345966488).
Almost surely, 2143131717561 is an apocalyptic number.
It is an amenable number.
143131717561 is a deficient number, since it is larger than the sum of its proper divisors (22403746247).
143131717561 is a wasteful number, since it uses less digits than its factorization.
143131717561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670272.
The product of its digits is 52920, while the sum is 40.
The spelling of 143131717561 in words is "one hundred forty-three billion, one hundred thirty-one million, seven hundred seventeen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •