Base | Representation |
---|---|
bin | 1000001110000011001… |
… | …0010000001011000101 |
3 | 111111111011221121000102 |
4 | 2003200302100023011 |
5 | 4303144304121201 |
6 | 144512053053445 |
7 | 13126215044060 |
oct | 2034062201305 |
9 | 444434847012 |
10 | 141210223301 |
11 | 54983542894 |
12 | 2344b027285 |
13 | 10415525864 |
14 | 6b9825d8d7 |
15 | 3a170cb26b |
hex | 20e0c902c5 |
141210223301 has 4 divisors (see below), whose sum is σ = 161383112352. Its totient is φ = 121037334252.
The previous prime is 141210223289. The next prime is 141210223387. The reversal of 141210223301 is 103322012141.
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 141210223301 - 218 = 141209961157 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141210223391) 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 3 ways as a sum of consecutive naturals, for example, 10086444515 + ... + 10086444528.
It is an arithmetic number, because the mean of its divisors is an integer number (40345778088).
Almost surely, 2141210223301 is an apocalyptic number.
It is an amenable number.
141210223301 is a deficient number, since it is larger than the sum of its proper divisors (20172889051).
141210223301 is an equidigital number, since it uses as much as digits as its factorization.
141210223301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20172889050.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 141210223301 its reverse (103322012141), we get a palindrome (244532235442).
The spelling of 141210223301 in words is "one hundred forty-one billion, two hundred ten million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •