Base | Representation |
---|---|
bin | 1110001101011011000… |
… | …0111110011011101001 |
3 | 212100010020100112212211 |
4 | 3203112300332123221 |
5 | 12444430030101213 |
6 | 304051531205121 |
7 | 23431361036230 |
oct | 3432660763351 |
9 | 770106315784 |
10 | 244121331433 |
11 | 94593144581 |
12 | 3b38b8a67a1 |
13 | 1a036195095 |
14 | bb5bb87b17 |
15 | 653bb9b53d |
hex | 38d6c3e6e9 |
244121331433 has 4 divisors (see below), whose sum is σ = 278995807360. Its totient is φ = 209246855508.
The previous prime is 244121331383. The next prime is 244121331449. The reversal of 244121331433 is 334133121442.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 244121331433 - 213 = 244121323241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 244121331395 and 244121331404.
It is not an unprimeable number, because it can be changed into a prime (244121331733) 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, 17437237953 + ... + 17437237966.
It is an arithmetic number, because the mean of its divisors is an integer number (69748951840).
Almost surely, 2244121331433 is an apocalyptic number.
It is an amenable number.
244121331433 is a deficient number, since it is larger than the sum of its proper divisors (34874475927).
244121331433 is an equidigital number, since it uses as much as digits as its factorization.
244121331433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34874475926.
The product of its digits is 20736, while the sum is 31.
Adding to 244121331433 its reverse (334133121442), we get a palindrome (578254452875).
The spelling of 244121331433 in words is "two hundred forty-four billion, one hundred twenty-one million, three hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •