Base | Representation |
---|---|
bin | 100000001001111101111001… |
… | …101110101010101111110001 |
3 | 200112201212000100001100120201 |
4 | 200021331321232222233301 |
5 | 122014031114142312431 |
6 | 1220440322335435201 |
7 | 41534301443335240 |
oct | 4011757156525761 |
9 | 615655010040521 |
10 | 141422430432241 |
11 | 41074a09116242 |
12 | 13a40745985b01 |
13 | 60bb1023a478a |
14 | 26ccc4c8c0957 |
15 | 1153ac6950461 |
hex | 809f79baabf1 |
141422430432241 has 32 divisors (see below), whose sum is σ = 167683730227200. Its totient is φ = 116715276216000.
The previous prime is 141422430432181. The next prime is 141422430432259. The reversal of 141422430432241 is 142234034224141.
It is not a de Polignac number, because 141422430432241 - 29 = 141422430431729 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 141422430432241.
It is not an unprimeable number, because it can be changed into a prime (141422430436241) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2025290970 + ... + 2025360796.
It is an arithmetic number, because the mean of its divisors is an integer number (5240116569600).
Almost surely, 2141422430432241 is an apocalyptic number.
It is an amenable number.
141422430432241 is a deficient number, since it is larger than the sum of its proper divisors (26261299794959).
141422430432241 is a wasteful number, since it uses less digits than its factorization.
141422430432241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116965.
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 141422430432241 its reverse (142234034224141), we get a palindrome (283656464656382).
The spelling of 141422430432241 in words is "one hundred forty-one trillion, four hundred twenty-two billion, four hundred thirty million, four hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.268 sec. • engine limits •