Base | Representation |
---|---|
bin | 100000100010110110011001… |
… | …001001111010100000000001 |
3 | 200202210022121220010210012102 |
4 | 200202312121021322200001 |
5 | 122230040030242332121 |
6 | 1224230032422040145 |
7 | 42101654115363500 |
oct | 4042663111724001 |
9 | 622708556123172 |
10 | 143132354652161 |
11 | 416740aa826076 |
12 | 14078013b79055 |
13 | 61b3427bb4014 |
14 | 274b9002a6837 |
15 | 118330365d90b |
hex | 822d9927a801 |
143132354652161 has 6 divisors (see below), whose sum is σ = 166500902350530. Its totient is φ = 122684875416096.
The previous prime is 143132354652127. The next prime is 143132354652187. The reversal of 143132354652161 is 161256453231341.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 119108083732225 + 24024270919936 = 10913665^2 + 4901456^2 .
It is not a de Polignac number, because 143132354652161 - 242 = 138734308141057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143132354652761) 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, 1460534231096 + ... + 1460534231193.
It is an arithmetic number, because the mean of its divisors is an integer number (27750150391755).
Almost surely, 2143132354652161 is an apocalyptic number.
It is an amenable number.
143132354652161 is a deficient number, since it is larger than the sum of its proper divisors (23368547698369).
143132354652161 is an equidigital number, since it uses as much as digits as its factorization.
143132354652161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2921068462303 (or 2921068462296 counting only the distinct ones).
The product of its digits is 1555200, while the sum is 47.
The spelling of 143132354652161 in words is "one hundred forty-three trillion, one hundred thirty-two billion, three hundred fifty-four million, six hundred fifty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •