Base | Representation |
---|---|
bin | 11111001101111101… |
… | …100100010110111101 |
3 | 10012112002020121220122 |
4 | 133031331210112331 |
5 | 1022122140140221 |
6 | 23222103024325 |
7 | 2264443224260 |
oct | 371575442675 |
9 | 105462217818 |
10 | 33520240061 |
11 | 13241335540 |
12 | 65b5a3b0a5 |
13 | 321279a199 |
14 | 189db94cd7 |
15 | d12bd2eab |
hex | 7cdf645bd |
33520240061 has 16 divisors (see below), whose sum is σ = 41796412800. Its totient is φ = 26116577280.
The previous prime is 33520240031. The next prime is 33520240099. The reversal of 33520240061 is 16004202533.
It is a cyclic number.
It is not a de Polignac number, because 33520240061 - 210 = 33520239037 is a prime.
It is a super-2 number, since 2×335202400612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 33520240061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33520240031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 800165 + ... + 841013.
It is an arithmetic number, because the mean of its divisors is an integer number (2612275800).
Almost surely, 233520240061 is an apocalyptic number.
It is an amenable number.
33520240061 is a deficient number, since it is larger than the sum of its proper divisors (8276172739).
33520240061 is a wasteful number, since it uses less digits than its factorization.
33520240061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51524.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 33520240061 its reverse (16004202533), we get a palindrome (49524442594).
The spelling of 33520240061 in words is "thirty-three billion, five hundred twenty million, two hundred forty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •