Base | Representation |
---|---|
bin | 100000000011111000100111… |
… | …000010001001011111000011 |
3 | 200111020220002020202100210211 |
4 | 200003320213002021133003 |
5 | 121440204033341432433 |
6 | 1215520312541334551 |
7 | 41462143152450100 |
oct | 4003704702113703 |
9 | 614226066670724 |
10 | 141004431202243 |
11 | 40a23709487a54 |
12 | 1399372a867457 |
13 | 608a878a454ab |
14 | 26b6918051aa7 |
15 | 1147caeca18cd |
hex | 803e270897c3 |
141004431202243 has 24 divisors (see below), whose sum is σ = 164344744055232. Its totient is φ = 120625806856464.
The previous prime is 141004431202237. The next prime is 141004431202267. The reversal of 141004431202243 is 342202134400141.
It is a happy number.
It is not a de Polignac number, because 141004431202243 - 241 = 138805407946691 is a prime.
It is a super-3 number, since 3×1410044312022433 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141004431202213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 230924580 + ... + 231534382.
It is an arithmetic number, because the mean of its divisors is an integer number (6847697668968).
Almost surely, 2141004431202243 is an apocalyptic number.
141004431202243 is a deficient number, since it is larger than the sum of its proper divisors (23340312852989).
141004431202243 is an equidigital number, since it uses as much as digits as its factorization.
141004431202243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 618991 (or 618984 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 141004431202243 its reverse (342202134400141), we get a palindrome (483206565602384).
The spelling of 141004431202243 in words is "one hundred forty-one trillion, four billion, four hundred thirty-one million, two hundred two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •