Base | Representation |
---|---|
bin | 1000001101100000000… |
… | …0100110100110010001 |
3 | 111111002220220101012112 |
4 | 2003120000212212101 |
5 | 4302344111141400 |
6 | 144445313235105 |
7 | 13122446430113 |
oct | 2033000464621 |
9 | 444086811175 |
10 | 141062990225 |
11 | 54908420463 |
12 | 23409862a95 |
13 | 103c0b851b1 |
14 | 6b828953b3 |
15 | 3a091e6835 |
hex | 20d8026991 |
141062990225 has 6 divisors (see below), whose sum is σ = 174918107910. Its totient is φ = 112850392160.
The previous prime is 141062990183. The next prime is 141062990227. The reversal of 141062990225 is 522099260141.
It can be written as a sum of positive squares in 3 ways, for example, as 1660073536 + 139402916689 = 40744^2 + 373367^2 .
It is not a de Polignac number, because 141062990225 - 210 = 141062989201 is a prime.
It is a super-2 number, since 2×1410629902252 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141062990227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2821259780 + ... + 2821259829.
It is an arithmetic number, because the mean of its divisors is an integer number (29153017985).
Almost surely, 2141062990225 is an apocalyptic number.
It is an amenable number.
141062990225 is a deficient number, since it is larger than the sum of its proper divisors (33855117685).
141062990225 is an equidigital number, since it uses as much as digits as its factorization.
141062990225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5642519619 (or 5642519614 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 41.
The spelling of 141062990225 in words is "one hundred forty-one billion, sixty-two million, nine hundred ninety thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •