Base | Representation |
---|---|
bin | 100111001101010110… |
… | …100011100000110000 |
3 | 11000200000110221000100 |
4 | 213031112203200300 |
5 | 1142210041310233 |
6 | 31201311552400 |
7 | 3020163435630 |
oct | 471526434060 |
9 | 130600427010 |
10 | 42099947568 |
11 | 169443607a8 |
12 | 81ab22b700 |
13 | 3c7c1525a3 |
14 | 20754426c0 |
15 | 116603d813 |
hex | 9cd5a3830 |
42099947568 has 240 divisors, whose sum is σ = 144586031616. Its totient is φ = 11161221120.
The previous prime is 42099947543. The next prime is 42099947573. The reversal of 42099947568 is 86574999024.
42099947568 is a `hidden beast` number, since 4 + 20 + 9 + 9 + 9 + 47 + 568 = 666.
It is a super-2 number, since 2×420999475682 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1199355 + ... + 1233957.
Almost surely, 242099947568 is an apocalyptic number.
42099947568 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42099947568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72293015808).
42099947568 is an abundant number, since it is smaller than the sum of its proper divisors (102486084048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42099947568 is a wasteful number, since it uses less digits than its factorization.
42099947568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34712 (or 34703 counting only the distinct ones).
The product of its (nonzero) digits is 39191040, while the sum is 63.
The spelling of 42099947568 in words is "forty-two billion, ninety-nine million, nine hundred forty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •