Base | Representation |
---|---|
bin | 1000000111001… |
… | …0000011111111 |
3 | 2101000110220102 |
4 | 2001302003333 |
5 | 32202143011 |
6 | 3213111315 |
7 | 562115300 |
oct | 201620377 |
9 | 71013812 |
10 | 34021631 |
11 | 18227a56 |
12 | b48853b |
13 | 7082657 |
14 | 47387a7 |
15 | 2ec073b |
hex | 20720ff |
34021631 has 6 divisors (see below), whose sum is σ = 39576240. Its totient is φ = 29161356.
The previous prime is 34021619. The next prime is 34021657. The reversal of 34021631 is 13612043.
34021631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-34021631 is a prime.
It is a super-2 number, since 2×340216312 = 2314942751800322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34021231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 347111 + ... + 347208.
It is an arithmetic number, because the mean of its divisors is an integer number (6596040).
Almost surely, 234021631 is an apocalyptic number.
34021631 is a deficient number, since it is larger than the sum of its proper divisors (5554609).
34021631 is an equidigital number, since it uses as much as digits as its factorization.
34021631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694333 (or 694326 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 34021631 is about 5832.8064428712. The cubic root of 34021631 is about 324.0298675662.
Adding to 34021631 its reverse (13612043), we get a palindrome (47633674).
The spelling of 34021631 in words is "thirty-four million, twenty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •