Base | Representation |
---|---|
bin | 1000010000100… |
… | …0000100010101 |
3 | 2102011200201210 |
4 | 2010020010111 |
5 | 32331323203 |
6 | 3234212033 |
7 | 600254514 |
oct | 204100425 |
9 | 72150653 |
10 | 34636053 |
11 | 18607641 |
12 | b724019 |
13 | 723920a |
14 | 485867b |
15 | 3092803 |
hex | 2108115 |
34636053 has 4 divisors (see below), whose sum is σ = 46181408. Its totient is φ = 23090700.
The previous prime is 34636051. The next prime is 34636057. The reversal of 34636053 is 35063643.
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.
It is not a de Polignac number, because 34636053 - 21 = 34636051 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 34636053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34636051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5772673 + ... + 5772678.
It is an arithmetic number, because the mean of its divisors is an integer number (11545352).
Almost surely, 234636053 is an apocalyptic number.
It is an amenable number.
34636053 is a deficient number, since it is larger than the sum of its proper divisors (11545355).
34636053 is a wasteful number, since it uses less digits than its factorization.
34636053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11545354.
The product of its (nonzero) digits is 19440, while the sum is 30.
The square root of 34636053 is about 5885.2402669730. The cubic root of 34636053 is about 325.9688736638.
Adding to 34636053 its reverse (35063643), we get a palindrome (69699696).
The spelling of 34636053 in words is "thirty-four million, six hundred thirty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •