Base | Representation |
---|---|
bin | 100000000110111001010001… |
… | …011011111101111111101001 |
3 | 200111222200001100212011211021 |
4 | 200012321101123331333221 |
5 | 122002101221031403301 |
6 | 1220155324240132441 |
7 | 41513115452213623 |
oct | 4006712133757751 |
9 | 614880040764737 |
10 | 141211301044201 |
11 | 40aa3416083093 |
12 | 13a07843007121 |
13 | 60a42263c7bbb |
14 | 26c294068bc13 |
15 | 114d36b3ce8a1 |
hex | 806e516fdfe9 |
141211301044201 has 4 divisors (see below), whose sum is σ = 141710280906832. Its totient is φ = 140712321181572.
The previous prime is 141211301044193. The next prime is 141211301044237. The reversal of 141211301044201 is 102440103112141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 141211301044201 - 23 = 141211301044193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141211301044001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249489930891 + ... + 249489931456.
It is an arithmetic number, because the mean of its divisors is an integer number (35427570226708).
Almost surely, 2141211301044201 is an apocalyptic number.
It is an amenable number.
141211301044201 is a deficient number, since it is larger than the sum of its proper divisors (498979862631).
141211301044201 is an equidigital number, since it uses as much as digits as its factorization.
141211301044201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498979862630.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 141211301044201 its reverse (102440103112141), we get a palindrome (243651404156342).
The spelling of 141211301044201 in words is "one hundred forty-one trillion, two hundred eleven billion, three hundred one million, forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •