Base | Representation |
---|---|
bin | 1000010000011… |
… | …0110110101001 |
3 | 2102011102220122 |
4 | 2010012312221 |
5 | 32331143311 |
6 | 3234133025 |
7 | 600234152 |
oct | 204066651 |
9 | 72142818 |
10 | 34631081 |
11 | 18603931 |
12 | b721175 |
13 | 7236b84 |
14 | 4856929 |
15 | 30910db |
hex | 2106da9 |
34631081 has 2 divisors, whose sum is σ = 34631082. Its totient is φ = 34631080.
The previous prime is 34631063. The next prime is 34631083. The reversal of 34631081 is 18013643.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24010000 + 10621081 = 4900^2 + 3259^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34631081 is a prime.
It is a super-2 number, since 2×346310812 = 2398623542457122, which contains 22 as substring.
Together with 34631083, 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 34631081.
It is not a weakly prime, because it can be changed into another prime (34631083) 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, 17315540 + 17315541.
It is an arithmetic number, because the mean of its divisors is an integer number (17315541).
Almost surely, 234631081 is an apocalyptic number.
It is an amenable number.
34631081 is a deficient number, since it is larger than the sum of its proper divisors (1).
34631081 is an equidigital number, since it uses as much as digits as its factorization.
34631081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 34631081 is about 5884.8178391519. The cubic root of 34631081 is about 325.9532753238.
The spelling of 34631081 in words is "thirty-four million, six hundred thirty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •