Base | Representation |
---|---|
bin | 1000001011110… |
… | …1111111010111 |
3 | 2101121021111221 |
4 | 2002331333113 |
5 | 32242121011 |
6 | 3223511211 |
7 | 564552064 |
oct | 202757727 |
9 | 71537457 |
10 | 34332631 |
11 | 1841a683 |
12 | b5b8507 |
13 | 7161088 |
14 | 47b9c6b |
15 | 3032971 |
hex | 20bdfd7 |
34332631 has 4 divisors (see below), whose sum is σ = 34914600. Its totient is φ = 33750664.
The previous prime is 34332587. The next prime is 34332637. The reversal of 34332631 is 13623343.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34332631 is a prime.
It is a super-2 number, since 2×343326312 = 2357459102764322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34332596 and 34332605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34332637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 290896 + ... + 291013.
It is an arithmetic number, because the mean of its divisors is an integer number (8728650).
Almost surely, 234332631 is an apocalyptic number.
34332631 is a deficient number, since it is larger than the sum of its proper divisors (581969).
34332631 is an equidigital number, since it uses as much as digits as its factorization.
34332631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581968.
The product of its digits is 3888, while the sum is 25.
The square root of 34332631 is about 5859.4053452548. The cubic root of 34332631 is about 325.0142194962.
Adding to 34332631 its reverse (13623343), we get a palindrome (47955974).
The spelling of 34332631 in words is "thirty-four million, three hundred thirty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •