Base | Representation |
---|---|
bin | 1000001110111010101… |
… | …1000110101001011101 |
3 | 111112002102101120112022 |
4 | 2003232223012221131 |
5 | 4304133431332201 |
6 | 144551135145525 |
7 | 13135044422552 |
oct | 2035653065135 |
9 | 445072346468 |
10 | 141443230301 |
11 | 54a9301a45a |
12 | 234b50752a5 |
13 | 10451898719 |
14 | 6bbb194a29 |
15 | 3a2c7a541b |
hex | 20eeac6a5d |
141443230301 has 8 divisors (see below), whose sum is σ = 146331151320. Its totient is φ = 136556013888.
The previous prime is 141443230267. The next prime is 141443230361. The reversal of 141443230301 is 103032344141.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2855299225 + 138587931076 = 53435^2 + 372274^2 .
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 141443230301 - 218 = 141442968157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141443230361) 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, 249755 + ... + 587591.
It is an arithmetic number, because the mean of its divisors is an integer number (18291393915).
Almost surely, 2141443230301 is an apocalyptic number.
It is an amenable number.
141443230301 is a deficient number, since it is larger than the sum of its proper divisors (4887921019).
141443230301 is a wasteful number, since it uses less digits than its factorization.
141443230301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 352303.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 141443230301 its reverse (103032344141), we get a palindrome (244475574442).
The spelling of 141443230301 in words is "one hundred forty-one billion, four hundred forty-three million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •