Base | Representation |
---|---|
bin | 100000000110101111111000… |
… | …001100111101100000001101 |
3 | 200111221201000101022101220121 |
4 | 200012233320030331200031 |
5 | 122001420041241100323 |
6 | 1220150535303544541 |
7 | 41512310466612100 |
oct | 4006577014754015 |
9 | 614851011271817 |
10 | 141201214003213 |
11 | 40a9a10a218981 |
12 | 13a058a8a5b151 |
13 | 60a32a96835b0 |
14 | 26c2264b4c737 |
15 | 114ce7aa7ba5d |
hex | 806bf833d80d |
141201214003213 has 96 divisors (see below), whose sum is σ = 187926084605952. Its totient is φ = 104937220080000.
The previous prime is 141201214003211. The next prime is 141201214003217. The reversal of 141201214003213 is 312300412102141.
It is not a de Polignac number, because 141201214003213 - 21 = 141201214003211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141201214003211) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 260825070 + ... + 261365872.
It is an arithmetic number, because the mean of its divisors is an integer number (1957563381312).
Almost surely, 2141201214003213 is an apocalyptic number.
141201214003213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
141201214003213 is a deficient number, since it is larger than the sum of its proper divisors (46724870602739).
141201214003213 is a wasteful number, since it uses less digits than its factorization.
141201214003213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 541175 (or 541168 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 141201214003213 its reverse (312300412102141), we get a palindrome (453501626105354).
The spelling of 141201214003213 in words is "one hundred forty-one trillion, two hundred one billion, two hundred fourteen million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •