Base | Representation |
---|---|
bin | 1000010010001… |
… | …1110111011001 |
3 | 2102101110220211 |
4 | 2010203313121 |
5 | 32343444123 |
6 | 3240451121 |
7 | 601240462 |
oct | 204436731 |
9 | 72343824 |
10 | 34749913 |
11 | 18685140 |
12 | b779aa1 |
13 | 7278ca3 |
14 | 4887d69 |
15 | 30b640d |
hex | 2123dd9 |
34749913 has 8 divisors (see below), whose sum is σ = 38187360. Its totient is φ = 31358880.
The previous prime is 34749907. The next prime is 34749943. The reversal of 34749913 is 31994743.
It is a happy number.
34749913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 34749913 - 25 = 34749881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34749943) 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 7 ways as a sum of consecutive naturals, for example, 10023 + ... + 13036.
It is an arithmetic number, because the mean of its divisors is an integer number (4773420).
Almost surely, 234749913 is an apocalyptic number.
It is an amenable number.
34749913 is a deficient number, since it is larger than the sum of its proper divisors (3437447).
34749913 is a wasteful number, since it uses less digits than its factorization.
34749913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23207.
The product of its digits is 81648, while the sum is 40.
The square root of 34749913 is about 5894.9056820275. The cubic root of 34749913 is about 326.3256716374.
It can be divided in two parts, 34 and 749913, that added together give a palindrome (749947).
The spelling of 34749913 in words is "thirty-four million, seven hundred forty-nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •