Base | Representation |
---|---|
bin | 1000001110100000000… |
… | …0101010001100101111 |
3 | 111111210122001001122202 |
4 | 2003220000222030233 |
5 | 4303421322043211 |
6 | 144532103132115 |
7 | 13132216264556 |
oct | 2035000521457 |
9 | 444718031582 |
10 | 141331440431 |
11 | 54a35a06035 |
12 | 2348374403b |
13 | 1043468777c |
14 | 6baa3b4d9d |
15 | 3a22a7253b |
hex | 20e802a32f |
141331440431 has 8 divisors (see below), whose sum is σ = 149650759440. Its totient is φ = 133012755328.
The previous prime is 141331440427. The next prime is 141331440449. The reversal of 141331440431 is 134044133141.
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 141331440431 - 22 = 141331440427 is a prime.
It is a super-2 number, since 2×1413314404312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141331440394 and 141331440403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141331440401) 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, 346565 + ... + 634641.
It is an arithmetic number, because the mean of its divisors is an integer number (18706344930).
Almost surely, 2141331440431 is an apocalyptic number.
141331440431 is a deficient number, since it is larger than the sum of its proper divisors (8319319009).
141331440431 is a wasteful number, since it uses less digits than its factorization.
141331440431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316953.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 141331440431 its reverse (134044133141), we get a palindrome (275375573572).
The spelling of 141331440431 in words is "one hundred forty-one billion, three hundred thirty-one million, four hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •