Base | Representation |
---|---|
bin | 1110001110100000110… |
… | …1110011101001110101 |
3 | 212100212122020211210002 |
4 | 3203220031303221311 |
5 | 13001030002232013 |
6 | 304140550241045 |
7 | 23441544406145 |
oct | 3435015635165 |
9 | 770778224702 |
10 | 244414102133 |
11 | 94723430533 |
12 | 3b451956185 |
13 | 1a081a31496 |
14 | bb889d8925 |
15 | 655772d358 |
hex | 38e8373a75 |
244414102133 has 4 divisors (see below), whose sum is σ = 245436755520. Its totient is φ = 243391448748.
The previous prime is 244414102129. The next prime is 244414102157. The reversal of 244414102133 is 331201414442.
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 244414102133 - 22 = 244414102129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 244414102096 and 244414102105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244414102183) 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, 511326335 + ... + 511326812.
It is an arithmetic number, because the mean of its divisors is an integer number (61359188880).
Almost surely, 2244414102133 is an apocalyptic number.
It is an amenable number.
244414102133 is a deficient number, since it is larger than the sum of its proper divisors (1022653387).
244414102133 is a wasteful number, since it uses less digits than its factorization.
244414102133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022653386.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 244414102133 its reverse (331201414442), we get a palindrome (575615516575).
The spelling of 244414102133 in words is "two hundred forty-four billion, four hundred fourteen million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •