Base | Representation |
---|---|
bin | 100000000110101111101100… |
… | …111000101101010000100101 |
3 | 200111221200112011001120121111 |
4 | 200012233230320231100211 |
5 | 122001414144140110141 |
6 | 1220150504402345021 |
7 | 41512303003052653 |
oct | 4006575470552045 |
9 | 614850464046544 |
10 | 141201024144421 |
11 | 40a9a02203218a |
12 | 13a0585535b171 |
13 | 60a327923a207 |
14 | 26c2247849dd3 |
15 | 114ce69077381 |
hex | 806bece2d425 |
141201024144421 has 8 divisors (see below), whose sum is σ = 141221304100800. Its totient is φ = 141180745026048.
The previous prime is 141201024144409. The next prime is 141201024144449. The reversal of 141201024144421 is 124441420102141.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141201024144421 - 27 = 141201024144293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141201024184421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 387288805 + ... + 387653221.
It is an arithmetic number, because the mean of its divisors is an integer number (17652663012600).
Almost surely, 2141201024144421 is an apocalyptic number.
It is an amenable number.
141201024144421 is a deficient number, since it is larger than the sum of its proper divisors (20279956379).
141201024144421 is an equidigital number, since it uses as much as digits as its factorization.
141201024144421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 419003.
The product of its (nonzero) digits is 8192, while the sum is 31.
Adding to 141201024144421 its reverse (124441420102141), we get a palindrome (265642444246562).
The spelling of 141201024144421 in words is "one hundred forty-one trillion, two hundred one billion, twenty-four million, one hundred forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •