Base | Representation |
---|---|
bin | 1110001101101110110… |
… | …0110100111101010011 |
3 | 212100100000011011100021 |
4 | 3203123230310331103 |
5 | 13000112224131011 |
6 | 304104050004311 |
7 | 23433414566653 |
oct | 3433354647523 |
9 | 770300134307 |
10 | 244204130131 |
11 | 94625957455 |
12 | 3b3b3576697 |
13 | 1a04a3952b0 |
14 | bb68b7c363 |
15 | 65440a4471 |
hex | 38dbb34f53 |
244204130131 has 16 divisors (see below), whose sum is σ = 269199764064. Its totient is φ = 220099428864.
The previous prime is 244204130119. The next prime is 244204130207. The reversal of 244204130131 is 131031402442.
It is a cyclic number.
It is not a de Polignac number, because 244204130131 - 25 = 244204130099 is a prime.
It is a super-2 number, since 2×2442041301312 (a number of 24 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 = 244204130096 and 244204130105.
It is not an unprimeable number, because it can be changed into a prime (244204130531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1544025 + ... + 1694821.
It is an arithmetic number, because the mean of its divisors is an integer number (16824985254).
Almost surely, 2244204130131 is an apocalyptic number.
244204130131 is a deficient number, since it is larger than the sum of its proper divisors (24995633933).
244204130131 is a wasteful number, since it uses less digits than its factorization.
244204130131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153750.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 244204130131 its reverse (131031402442), we get a palindrome (375235532573).
The spelling of 244204130131 in words is "two hundred forty-four billion, two hundred four million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •