Base | Representation |
---|---|
bin | 100111011010101101… |
… | …011011001010100100 |
3 | 11001020122011022221210 |
4 | 213122231123022210 |
5 | 1143134423442000 |
6 | 31235435111420 |
7 | 3025554313401 |
oct | 473255331244 |
9 | 131218138853 |
10 | 42324046500 |
11 | 16a4990362a |
12 | 82522a2570 |
13 | 3cb66c68c8 |
14 | 20970d92a8 |
15 | 117aa58350 |
hex | 9dab5b2a4 |
42324046500 has 48 divisors (see below), whose sum is σ = 123247627776. Its totient is φ = 11286412000.
The previous prime is 42324046489. The next prime is 42324046511. The reversal of 42324046500 is 564042324.
It is an interprime number because it is at equal distance from previous prime (42324046489) and next prime (42324046511).
It is a super-3 number, since 3×423240465003 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 15 ways as a sum of consecutive naturals, for example, 14106516 + ... + 14109515.
It is an arithmetic number, because the mean of its divisors is an integer number (2567658912).
Almost surely, 242324046500 is an apocalyptic number.
It is an amenable number.
42324046500 is an abundant number, since it is smaller than the sum of its proper divisors (80923581276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42324046500 is a wasteful number, since it uses less digits than its factorization.
42324046500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28216053 (or 28216041 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 30.
Adding to 42324046500 its reverse (564042324), we get a palindrome (42888088824).
The spelling of 42324046500 in words is "forty-two billion, three hundred twenty-four million, forty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •