Base | Representation |
---|---|
bin | 100111011010101011… |
… | …110100001011010111 |
3 | 11001020121100220022012 |
4 | 213122223310023113 |
5 | 1143134321442123 |
6 | 31235422054435 |
7 | 3025550605505 |
oct | 473253641327 |
9 | 131217326265 |
10 | 42323624663 |
11 | 16a49645701 |
12 | 825211a41b |
13 | 3cb65a98b8 |
14 | 2097029675 |
15 | 117a9c3378 |
hex | 9daaf42d7 |
42323624663 has 8 divisors (see below), whose sum is σ = 43691155728. Its totient is φ = 40973514624.
The previous prime is 42323624653. The next prime is 42323624723. The reversal of 42323624663 is 36642632324.
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 42323624663 - 24 = 42323624647 is a prime.
It is a super-2 number, since 2×423236246632 (a number of 22 digits) contains 22 as substring.
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 42323624663.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42323624653) 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, 4350320 + ... + 4360037.
It is an arithmetic number, because the mean of its divisors is an integer number (5461394466).
Almost surely, 242323624663 is an apocalyptic number.
42323624663 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
42323624663 is a deficient number, since it is larger than the sum of its proper divisors (1367531065).
42323624663 is a wasteful number, since it uses less digits than its factorization.
42323624663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8710513.
The product of its digits is 746496, while the sum is 41.
The spelling of 42323624663 in words is "forty-two billion, three hundred twenty-three million, six hundred twenty-four thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •