Base | Representation |
---|---|
bin | 1000000001010… |
… | …1001000110101 |
3 | 2100022010210110 |
4 | 2000111020311 |
5 | 32103003023 |
6 | 3201013233 |
7 | 555641520 |
oct | 200251065 |
9 | 70263713 |
10 | 33641013 |
11 | 17a97a9a |
12 | b324219 |
13 | 6c7b333 |
14 | 4679bb7 |
15 | 2e47a93 |
hex | 2015235 |
33641013 has 8 divisors (see below), whose sum is σ = 51262528. Its totient is φ = 19223424.
The previous prime is 33640993. The next prime is 33641051. The reversal of 33641013 is 31014633.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 33641013 - 28 = 33640757 is a prime.
It is a super-2 number, since 2×336410132 = 2263435511332338, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 1601953 = 33641013 / (3 + 3 + 6 + 4 + 1 + 0 + 1 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33641053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 800956 + ... + 800997.
It is an arithmetic number, because the mean of its divisors is an integer number (6407816).
Almost surely, 233641013 is an apocalyptic number.
It is an amenable number.
33641013 is a deficient number, since it is larger than the sum of its proper divisors (17621515).
33641013 is a wasteful number, since it uses less digits than its factorization.
33641013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1601963.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 33641013 is about 5800.0873269288. The cubic root of 33641013 is about 322.8169685774.
Adding to 33641013 its reverse (31014633), we get a palindrome (64655646).
The spelling of 33641013 in words is "thirty-three million, six hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •