Base | Representation |
---|---|
bin | 1000001111100010100… |
… | …1111101000110101001 |
3 | 111112112002111222110010 |
4 | 2003320221331012221 |
5 | 4310004314414400 |
6 | 145015520442133 |
7 | 13142150046150 |
oct | 2037051750651 |
9 | 445462458403 |
10 | 141610701225 |
11 | 55069604884 |
12 | 23541179349 |
13 | 1047a4a3846 |
14 | 6bd550a597 |
15 | 3a3c336450 |
hex | 20f8a7d1a9 |
141610701225 has 24 divisors (see below), whose sum is σ = 267576792640. Its totient is φ = 64736320320.
The previous prime is 141610701149. The next prime is 141610701269. The reversal of 141610701225 is 522107016141.
141610701225 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 141610701225 - 219 = 141610176937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141610701192 and 141610701201.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 134866810 + ... + 134867859.
Almost surely, 2141610701225 is an apocalyptic number.
141610701225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
141610701225 is a deficient number, since it is larger than the sum of its proper divisors (125966091415).
141610701225 is a wasteful number, since it uses less digits than its factorization.
141610701225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269734689 (or 269734684 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 30.
Adding to 141610701225 its reverse (522107016141), we get a palindrome (663717717366).
The spelling of 141610701225 in words is "one hundred forty-one billion, six hundred ten million, seven hundred one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •