Base | Representation |
---|---|
bin | 1000001110100100110… |
… | …0000101101000111111 |
3 | 111111212000020122101111 |
4 | 2003221030011220333 |
5 | 4303441402314011 |
6 | 144534051022451 |
7 | 13132546330435 |
oct | 2035114055077 |
9 | 444760218344 |
10 | 141351213631 |
11 | 54a46090a21 |
12 | 2348a29aa27 |
13 | 104387bb8a4 |
14 | 6bacc80d55 |
15 | 3a2467b121 |
hex | 20e9305a3f |
141351213631 has 4 divisors (see below), whose sum is σ = 141354717832. Its totient is φ = 141347709432.
The previous prime is 141351213623. The next prime is 141351213637. The reversal of 141351213631 is 136312153141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141351213631 - 23 = 141351213623 is a prime.
It is a super-2 number, since 2×1413512136312 (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 = 141351213593 and 141351213602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141351213637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1690881 + ... + 1772506.
It is an arithmetic number, because the mean of its divisors is an integer number (35338679458).
Almost surely, 2141351213631 is an apocalyptic number.
141351213631 is a deficient number, since it is larger than the sum of its proper divisors (3504201).
141351213631 is an equidigital number, since it uses as much as digits as its factorization.
141351213631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3504200.
The product of its digits is 6480, while the sum is 31.
Adding to 141351213631 its reverse (136312153141), we get a palindrome (277663366772).
The spelling of 141351213631 in words is "one hundred forty-one billion, three hundred fifty-one million, two hundred thirteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •