Base | Representation |
---|---|
bin | 1000010101101… |
… | …1010010111010 |
3 | 2102211000100202 |
4 | 2011123102322 |
5 | 32423230304 |
6 | 3245402202 |
7 | 603204425 |
oct | 205332272 |
9 | 72730322 |
10 | 34976954 |
11 | 1881a781 |
12 | b869362 |
13 | 732842c |
14 | 49069bc |
15 | 310d81e |
hex | 215b4ba |
34976954 has 4 divisors (see below), whose sum is σ = 52465434. Its totient is φ = 17488476.
The previous prime is 34976941. The next prime is 34976957. The reversal of 34976954 is 45967943.
It is a happy number.
34976954 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, and also an emirpimes, since its reverse is a distinct semiprime: 45967943 = 7 ⋅6566849.
It can be written as a sum of positive squares in only one way, i.e., 29106025 + 5870929 = 5395^2 + 2423^2 .
It is a super-2 number, since 2×349769542 = 2446774622236232, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 34976899 and 34976908.
It is not an unprimeable number, because it can be changed into a prime (34976957) 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 as a sum of consecutive naturals, namely, 8744237 + ... + 8744240.
Almost surely, 234976954 is an apocalyptic number.
34976954 is a deficient number, since it is larger than the sum of its proper divisors (17488480).
34976954 is a wasteful number, since it uses less digits than its factorization.
34976954 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17488479.
The product of its digits is 816480, while the sum is 47.
The square root of 34976954 is about 5914.1317198723. The cubic root of 34976954 is about 327.0348200225.
The spelling of 34976954 in words is "thirty-four million, nine hundred seventy-six thousand, nine hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •