Base | Representation |
---|---|
bin | 1000010101100… |
… | …1110110100011 |
3 | 2102210201020211 |
4 | 2011121312203 |
5 | 32423033133 |
6 | 3245314551 |
7 | 603151252 |
oct | 205316643 |
9 | 72721224 |
10 | 34971043 |
11 | 18816298 |
12 | b865a57 |
13 | 7325833 |
14 | 4904799 |
15 | 310bbcd |
hex | 2159da3 |
34971043 has 4 divisors (see below), whose sum is σ = 35630928. Its totient is φ = 34311160.
The previous prime is 34971029. The next prime is 34971047. The reversal of 34971043 is 34017943.
34971043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 34971043 - 29 = 34970531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34970996 and 34971014.
It is not an unprimeable number, because it can be changed into a prime (34971047) 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 3 ways as a sum of consecutive naturals, for example, 329863 + ... + 329968.
It is an arithmetic number, because the mean of its divisors is an integer number (8907732).
Almost surely, 234971043 is an apocalyptic number.
34971043 is a deficient number, since it is larger than the sum of its proper divisors (659885).
34971043 is an equidigital number, since it uses as much as digits as its factorization.
34971043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659884.
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 34971043 is about 5913.6319635229. The cubic root of 34971043 is about 327.0163963510.
Adding to 34971043 its reverse (34017943), we get a palindrome (68988986).
The spelling of 34971043 in words is "thirty-four million, nine hundred seventy-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •