Base | Representation |
---|---|
bin | 1100111001010111010… |
… | …10111111000100000011 |
3 | 1120100202101202202120100 |
4 | 12130223222333010003 |
5 | 24224444231221011 |
6 | 535321445413443 |
7 | 44004533401230 |
oct | 6345352770403 |
9 | 1510671682510 |
10 | 443114320131 |
11 | 160a1853322a |
12 | 71a6610a283 |
13 | 32a29990982 |
14 | 17638214787 |
15 | b7d6a06d56 |
hex | 672babf103 |
443114320131 has 96 divisors (see below), whose sum is σ = 778000204800. Its totient is φ = 237245386752.
The previous prime is 443114320109. The next prime is 443114320139. The reversal of 443114320131 is 131023411344.
443114320131 is a `hidden beast` number, since 443 + 1 + 14 + 3 + 201 + 3 + 1 = 666.
It is not a de Polignac number, because 443114320131 - 27 = 443114320003 is a prime.
It is a super-2 number, since 2×4431143201312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 443114320095 and 443114320104.
It is not an unprimeable number, because it can be changed into a prime (443114320139) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 316735770 + ... + 316737168.
It is an arithmetic number, because the mean of its divisors is an integer number (8104168800).
Almost surely, 2443114320131 is an apocalyptic number.
443114320131 is a deficient number, since it is larger than the sum of its proper divisors (334885884669).
443114320131 is a wasteful number, since it uses less digits than its factorization.
443114320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2545 (or 2542 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 443114320131 its reverse (131023411344), we get a palindrome (574137731475).
The spelling of 443114320131 in words is "four hundred forty-three billion, one hundred fourteen million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •