Base | Representation |
---|---|
bin | 1000001010111… |
… | …10101000001001 |
3 | 11202222110002221 |
4 | 10011132220021 |
5 | 120021420113 |
6 | 10445054041 |
7 | 1461423514 |
oct | 405365011 |
9 | 152873087 |
10 | 68545033 |
11 | 35767997 |
12 | 1ab57321 |
13 | 1127c4bb |
14 | 9163d7b |
15 | 603e98d |
hex | 415ea09 |
68545033 has 4 divisors (see below), whose sum is σ = 69510528. Its totient is φ = 67579540.
The previous prime is 68545031. The next prime is 68545051. The reversal of 68545033 is 33054586.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33054586 = 2 ⋅16527293.
It is a cyclic number.
It is not a de Polignac number, because 68545033 - 21 = 68545031 is a prime.
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 68545033.
It is not an unprimeable number, because it can be changed into a prime (68545031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 482641 + ... + 482782.
It is an arithmetic number, because the mean of its divisors is an integer number (17377632).
Almost surely, 268545033 is an apocalyptic number.
It is an amenable number.
68545033 is a deficient number, since it is larger than the sum of its proper divisors (965495).
68545033 is an equidigital number, since it uses as much as digits as its factorization.
68545033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965494.
The product of its (nonzero) digits is 43200, while the sum is 34.
The square root of 68545033 is about 8279.1927746611. The cubic root of 68545033 is about 409.2531177512.
The spelling of 68545033 in words is "sixty-eight million, five hundred forty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •