Base | Representation |
---|---|
bin | 11111100010101101… |
… | …001100101100100000 |
3 | 10020102100010101202000 |
4 | 133202231030230200 |
5 | 1023330234122433 |
6 | 23320414324000 |
7 | 2306200356012 |
oct | 374255145440 |
9 | 106370111660 |
10 | 33868270368 |
11 | 133aa834899 |
12 | 66924b9600 |
13 | 326991398a |
14 | 18d40ac1b2 |
15 | d3352d113 |
hex | 7e2b4cb20 |
33868270368 has 96 divisors (see below), whose sum is σ = 102188822400. Its totient is φ = 10900124928.
The previous prime is 33868270351. The next prime is 33868270409. The reversal of 33868270368 is 86307286833.
33868270368 is a `hidden beast` number, since 3 + 3 + 8 + 6 + 8 + 270 + 368 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×338682703682 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 650796 + ... + 700907.
It is an arithmetic number, because the mean of its divisors is an integer number (1064466900).
Almost surely, 233868270368 is an apocalyptic number.
It is an amenable number.
33868270368 is an abundant number, since it is smaller than the sum of its proper divisors (68320552032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33868270368 is a wasteful number, since it uses less digits than its factorization.
33868270368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1351751 (or 1351737 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 54.
The spelling of 33868270368 in words is "thirty-three billion, eight hundred sixty-eight million, two hundred seventy thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •