Base | Representation |
---|---|
bin | 1110101111101010011010… |
… | …00000010011010110110111 |
3 | 11020210201000022102110100010 |
4 | 13113311031000103112313 |
5 | 13222213323002324143 |
6 | 152543214024351303 |
7 | 6554361642653403 |
oct | 727651500232667 |
9 | 136721008373303 |
10 | 32424000042423 |
11 | a370a39806340 |
12 | 3777ba4015533 |
13 | 1512754624392 |
14 | 80148964a103 |
15 | 3b365169da33 |
hex | 1d7d4d0135b7 |
32424000042423 has 8 divisors (see below), whose sum is σ = 47162181879936. Its totient is φ = 19650909116600.
The previous prime is 32424000042403. The next prime is 32424000042433.
32424000042423 is nontrivially palindromic in base 10.
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 32424000042423 - 210 = 32424000041399 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32424000042403) 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, 491272727883 + ... + 491272727948.
It is an arithmetic number, because the mean of its divisors is an integer number (5895272734992).
Almost surely, 232424000042423 is an apocalyptic number.
32424000042423 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
32424000042423 is a deficient number, since it is larger than the sum of its proper divisors (14738181837513).
32424000042423 is a wasteful number, since it uses less digits than its factorization.
32424000042423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982545455845.
The product of its (nonzero) digits is 36864, while the sum is 30.
It can be divided in two parts, 324240000 and 42423, that added together give a palindrome (324282423).
The spelling of 32424000042423 in words is "thirty-two trillion, four hundred twenty-four billion, forty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •