Base | Representation |
---|---|
bin | 100011011110101101000… |
… | …110100111110100000111 |
3 | 22122002021220121002202021 |
4 | 203132231012213310013 |
5 | 304421313031314033 |
6 | 5104023154024011 |
7 | 341102434406164 |
oct | 43365506476407 |
9 | 8562256532667 |
10 | 2438150651143 |
11 | 860017531039 |
12 | 334643878007 |
13 | 148bbba76cac |
14 | 8601577d06b |
15 | 4364dd57b2d |
hex | 237ad1a7d07 |
2438150651143 has 8 divisors (see below), whose sum is σ = 2490229540800. Its totient is φ = 2386080234240.
The previous prime is 2438150651059. The next prime is 2438150651149. The reversal of 2438150651143 is 3411560518342.
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 2438150651143 - 225 = 2438117096711 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2438150651143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2438150651149) 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 7 ways as a sum of consecutive naturals, for example, 1534818 + ... + 2689231.
It is an arithmetic number, because the mean of its divisors is an integer number (311278692600).
Almost surely, 22438150651143 is an apocalyptic number.
2438150651143 is a deficient number, since it is larger than the sum of its proper divisors (52078889657).
2438150651143 is a wasteful number, since it uses less digits than its factorization.
2438150651143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4236377.
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 2438150651143 in words is "two trillion, four hundred thirty-eight billion, one hundred fifty million, six hundred fifty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •