Base | Representation |
---|---|
bin | 1000001110011001100… |
… | …0111010011100111111 |
3 | 111111201201212100012200 |
4 | 2003212120322130333 |
5 | 4303342341302111 |
6 | 144525252202543 |
7 | 13131436154016 |
oct | 2034630723477 |
9 | 444651770180 |
10 | 141304244031 |
11 | 54a2161aa75 |
12 | 23476609453 |
13 | 1042bb54922 |
14 | 6ba6935a7d |
15 | 3a2049e256 |
hex | 20e663a73f |
141304244031 has 24 divisors (see below), whose sum is σ = 211231098000. Its totient is φ = 90917054592.
The previous prime is 141304244017. The next prime is 141304244071. The reversal of 141304244031 is 130442403141.
141304244031 is a `hidden beast` number, since 1 + 413 + 0 + 4 + 244 + 0 + 3 + 1 = 666.
It is not a de Polignac number, because 141304244031 - 229 = 140767373119 is a prime.
It is a super-2 number, since 2×1413042440312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141304243986 and 141304244004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141304244071) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 531715 + ... + 751883.
It is an arithmetic number, because the mean of its divisors is an integer number (8801295750).
Almost surely, 2141304244031 is an apocalyptic number.
141304244031 is a deficient number, since it is larger than the sum of its proper divisors (69926853969).
141304244031 is a wasteful number, since it uses less digits than its factorization.
141304244031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222663 (or 222660 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 141304244031 its reverse (130442403141), we get a palindrome (271746647172).
The spelling of 141304244031 in words is "one hundred forty-one billion, three hundred four million, two hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •