Base | Representation |
---|---|
bin | 1101101101010100010110… |
… | …00011011000011111111011 |
3 | 10221201202222222222202011112 |
4 | 12312222023003120133323 |
5 | 12422341224312400011 |
6 | 144040052523350535 |
7 | 6230601444146066 |
oct | 666521303303773 |
9 | 127652888882145 |
10 | 30144413403131 |
11 | 96721a05592a5 |
12 | 346a23308244b |
13 | 13a87b5477a91 |
14 | 762dd6bc18dd |
15 | 3741d31d058b |
hex | 1b6a8b0d87fb |
30144413403131 has 8 divisors (see below), whose sum is σ = 32177876428800. Its totient is φ = 28155641872680.
The previous prime is 30144413403103. The next prime is 30144413403151. The reversal of 30144413403131 is 13130431444103.
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 30144413403131 - 238 = 29869535496187 is a prime.
It is a super-2 number, since 2×301444134031312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30144413403151) 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, 11172872411 + ... + 11172875108.
It is an arithmetic number, because the mean of its divisors is an integer number (4022234553600).
Almost surely, 230144413403131 is an apocalyptic number.
30144413403131 is a deficient number, since it is larger than the sum of its proper divisors (2033463025669).
30144413403131 is a wasteful number, since it uses less digits than its factorization.
30144413403131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22345747609.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 30144413403131 its reverse (13130431444103), we get a palindrome (43274844847234).
The spelling of 30144413403131 in words is "thirty trillion, one hundred forty-four billion, four hundred thirteen million, four hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •