Base | Representation |
---|---|
bin | 11111100100010100… |
… | …100100111110010000 |
3 | 10020111020010020022210 |
4 | 133210110210332100 |
5 | 1023404203330030 |
6 | 23323223232120 |
7 | 2306646616365 |
oct | 374424447620 |
9 | 106436106283 |
10 | 33895370640 |
11 | 1341406470a |
12 | 669b5a8640 |
13 | 3272411b41 |
14 | 18d792446c |
15 | d35ad2bb0 |
hex | 7e4524f90 |
33895370640 has 80 divisors (see below), whose sum is σ = 105373577088. Its totient is φ = 9013137408.
The previous prime is 33895370633. The next prime is 33895370657. The reversal of 33895370640 is 4607359833.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×338953706402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 33895370640.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115324 + ... + 284763.
Almost surely, 233895370640 is an apocalyptic number.
33895370640 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
33895370640 is an abundant number, since it is smaller than the sum of its proper divisors (71478206448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33895370640 is a wasteful number, since it uses less digits than its factorization.
33895370640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400456 (or 400450 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 48.
The spelling of 33895370640 in words is "thirty-three billion, eight hundred ninety-five million, three hundred seventy thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •