Base | Representation |
---|---|
bin | 1110001110001111101… |
… | …1101011001111100111 |
3 | 212100200122000212210011 |
4 | 3203203323223033213 |
5 | 13000403103141411 |
6 | 304125502111051 |
7 | 23440012526215 |
oct | 3434373531747 |
9 | 770618025704 |
10 | 244342240231 |
11 | 94696908631 |
12 | 3b43187b487 |
13 | 1a06cb9034b |
14 | bb7d24dcb5 |
15 | 6551285c21 |
hex | 38e3eeb3e7 |
244342240231 has 4 divisors (see below), whose sum is σ = 244432306432. Its totient is φ = 244252174032.
The previous prime is 244342240223. The next prime is 244342240313. The reversal of 244342240231 is 132042243442.
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 244342240231 - 23 = 244342240223 is a prime.
It is a super-2 number, since 2×2443422402312 (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 = 244342240193 and 244342240202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244342240211) 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, 45029031 + ... + 45034456.
It is an arithmetic number, because the mean of its divisors is an integer number (61108076608).
Almost surely, 2244342240231 is an apocalyptic number.
244342240231 is a deficient number, since it is larger than the sum of its proper divisors (90066201).
244342240231 is an equidigital number, since it uses as much as digits as its factorization.
244342240231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90066200.
The product of its (nonzero) digits is 36864, while the sum is 31.
Adding to 244342240231 its reverse (132042243442), we get a palindrome (376384483673).
The spelling of 244342240231 in words is "two hundred forty-four billion, three hundred forty-two million, two hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •