Base | Representation |
---|---|
bin | 1000010101001010101… |
… | …1010100111000110001 |
3 | 111200102100102121220111 |
4 | 2011102223110320301 |
5 | 4321102434311400 |
6 | 145425431541321 |
7 | 13224446341324 |
oct | 2052253247061 |
9 | 450370377814 |
10 | 143121010225 |
11 | 55774096336 |
12 | 238a2b2a841 |
13 | 1065b3651cb |
14 | 6cd9d347bb |
15 | 3ac9c1a3ba |
hex | 2152ad4e31 |
143121010225 has 12 divisors (see below), whose sum is σ = 177996680524. Its totient is φ = 114157048320.
The previous prime is 143121010223. The next prime is 143121010289. The reversal of 143121010225 is 522010121341.
It can be written as a sum of positive squares in 6 ways, for example, as 2789107344 + 140331902881 = 52812^2 + 374609^2 .
It is not a de Polignac number, because 143121010225 - 21 = 143121010223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143121010196 and 143121010205.
It is not an unprimeable number, because it can be changed into a prime (143121010223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8485404 + ... + 8502253.
Almost surely, 2143121010225 is an apocalyptic number.
It is an amenable number.
143121010225 is a deficient number, since it is larger than the sum of its proper divisors (34875670299).
143121010225 is a wasteful number, since it uses less digits than its factorization.
143121010225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16988004 (or 16987999 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 143121010225 its reverse (522010121341), we get a palindrome (665131131566).
The spelling of 143121010225 in words is "one hundred forty-three billion, one hundred twenty-one million, ten thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •