Base | Representation |
---|---|
bin | 100000000110110000101000… |
… | …111111000011011010101001 |
3 | 200111221210010102100100111021 |
4 | 200012300220333003122221 |
5 | 122001423230301103001 |
6 | 1220151152421532441 |
7 | 41512336665330100 |
oct | 4006605077033251 |
9 | 614853112310437 |
10 | 141202032441001 |
11 | 40a9a49a202344 |
12 | 13a05a96b74121 |
13 | 60a33aa0c07cc |
14 | 26c2301717037 |
15 | 114cec7846ba1 |
hex | 806c28fc36a9 |
141202032441001 has 12 divisors (see below), whose sum is σ = 164257185151620. Its totient is φ = 121029016930080.
The previous prime is 141202032440957. The next prime is 141202032441011. The reversal of 141202032441001 is 100144230202141.
It can be written as a sum of positive squares in 2 ways, for example, as 77952141560601 + 63249890880400 = 8829051^2 + 7952980^2 .
It is not a de Polignac number, because 141202032441001 - 213 = 141202032432809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141202032441011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10800970 + ... + 19976611.
It is an arithmetic number, because the mean of its divisors is an integer number (13688098762635).
Almost surely, 2141202032441001 is an apocalyptic number.
It is an amenable number.
141202032441001 is a deficient number, since it is larger than the sum of its proper divisors (23055152710619).
141202032441001 is an equidigital number, since it uses as much as digits as its factorization.
141202032441001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30871224 (or 30871217 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 141202032441001 its reverse (100144230202141), we get a palindrome (241346262643142).
The spelling of 141202032441001 in words is "one hundred forty-one trillion, two hundred two billion, thirty-two million, four hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •