Base | Representation |
---|---|
bin | 1000001110111000010… |
… | …0100010111001111111 |
3 | 111112001201101001010202 |
4 | 2003232010202321333 |
5 | 4304123334404211 |
6 | 144550134354115 |
7 | 13134562463546 |
oct | 2035604427177 |
9 | 445051331122 |
10 | 141433122431 |
11 | 54a88346247 |
12 | 234b17bb93b |
13 | 1044c769a33 |
14 | 6bb9ac315d |
15 | 3a2b95a53b |
hex | 20ee122e7f |
141433122431 has 8 divisors (see below), whose sum is σ = 150761491200. Its totient is φ = 132293205720.
The previous prime is 141433122407. The next prime is 141433122503. The reversal of 141433122431 is 134221334141.
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 141433122431 - 26 = 141433122367 is a prime.
It is a super-2 number, since 2×1414331224312 (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 = 141433122394 and 141433122403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141433122401) 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, 47111465 + ... + 47114466.
It is an arithmetic number, because the mean of its divisors is an integer number (18845186400).
Almost surely, 2141433122431 is an apocalyptic number.
141433122431 is a deficient number, since it is larger than the sum of its proper divisors (9328368769).
141433122431 is an equidigital number, since it uses as much as digits as its factorization.
141433122431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94226029.
The product of its digits is 6912, while the sum is 29.
Adding to 141433122431 its reverse (134221334141), we get a palindrome (275654456572).
The spelling of 141433122431 in words is "one hundred forty-one billion, four hundred thirty-three million, one hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •