Base | Representation |
---|---|
bin | 1000010000010… |
… | …1010111010101 |
3 | 2102011010112201 |
4 | 2010011113111 |
5 | 32330444411 |
6 | 3234044501 |
7 | 600210316 |
oct | 204052725 |
9 | 72133481 |
10 | 34624981 |
11 | 185aa296 |
12 | b719731 |
13 | 7234171 |
14 | 485460d |
15 | 308e3c1 |
hex | 21055d5 |
34624981 has 2 divisors, whose sum is σ = 34624982. Its totient is φ = 34624980.
The previous prime is 34624979. The next prime is 34625009. The reversal of 34624981 is 18942643.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19061956 + 15563025 = 4366^2 + 3945^2 .
It is a cyclic number.
It is not a de Polignac number, because 34624981 - 21 = 34624979 is a prime.
It is a super-2 number, since 2×346249812 = 2397778618500722, which contains 22 as substring.
Together with 34624979, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 34624981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34624901) 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 as a sum of consecutive naturals, namely, 17312490 + 17312491.
It is an arithmetic number, because the mean of its divisors is an integer number (17312491).
Almost surely, 234624981 is an apocalyptic number.
It is an amenable number.
34624981 is a deficient number, since it is larger than the sum of its proper divisors (1).
34624981 is an equidigital number, since it uses as much as digits as its factorization.
34624981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 37.
The square root of 34624981 is about 5884.2995335044. The cubic root of 34624981 is about 325.9341361414.
The spelling of 34624981 in words is "thirty-four million, six hundred twenty-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •