Base | Representation |
---|---|
bin | 1110001101110000111… |
… | …0110100100001010011 |
3 | 212100100121220220002011 |
4 | 3203130032310201103 |
5 | 13000122014304420 |
6 | 304105005003351 |
7 | 23433553412602 |
oct | 3433416644123 |
9 | 770317826064 |
10 | 244213041235 |
11 | 9462a9934a9 |
12 | 3b3b6553557 |
13 | 1a04c195337 |
14 | bb6a01ba39 |
15 | 6544c6495a |
hex | 38dc3b4853 |
244213041235 has 8 divisors (see below), whose sum is σ = 293059603440. Its totient is φ = 195367797024.
The previous prime is 244213041227. The next prime is 244213041257. The reversal of 244213041235 is 532140312442.
244213041235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 244213041235 - 23 = 244213041227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 244213041197 and 244213041206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138604 + ... + 712486.
It is an arithmetic number, because the mean of its divisors is an integer number (36632450430).
Almost surely, 2244213041235 is an apocalyptic number.
244213041235 is a deficient number, since it is larger than the sum of its proper divisors (48846562205).
244213041235 is an equidigital number, since it uses as much as digits as its factorization.
244213041235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658997.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 244213041235 its reverse (532140312442), we get a palindrome (776353353677).
The spelling of 244213041235 in words is "two hundred forty-four billion, two hundred thirteen million, forty-one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •