Base | Representation |
---|---|
bin | 100011010001101001110… |
… | …001100001111011000111 |
3 | 22120202010012211111201121 |
4 | 203101221301201323013 |
5 | 304204112323143011 |
6 | 5053344402334411 |
7 | 340065232160353 |
oct | 43215161417307 |
9 | 8522105744647 |
10 | 2424136146631 |
11 | 855085726401 |
12 | 33199235a407 |
13 | 14779745a184 |
14 | 854863ac463 |
15 | 430cd80be71 |
hex | 23469c61ec7 |
2424136146631 has 8 divisors (see below), whose sum is σ = 2434737754800. Its totient is φ = 2413557662208.
The previous prime is 2424136146617. The next prime is 2424136146643. The reversal of 2424136146631 is 1366416314242.
2424136146631 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 2424136146631 - 215 = 2424136113863 is a prime.
It is a super-2 number, since 2×24241361466312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2424136146931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5570796 + ... + 5990161.
It is an arithmetic number, because the mean of its divisors is an integer number (304342219350).
Almost surely, 22424136146631 is an apocalyptic number.
2424136146631 is a deficient number, since it is larger than the sum of its proper divisors (10601608169).
2424136146631 is a wasteful number, since it uses less digits than its factorization.
2424136146631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11561873.
The product of its digits is 497664, while the sum is 43.
The spelling of 2424136146631 in words is "two trillion, four hundred twenty-four billion, one hundred thirty-six million, one hundred forty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.274 sec. • engine limits •