Base | Representation |
---|---|
bin | 1011001110010… |
… | …1011000110001 |
3 | 10021120202101101 |
4 | 2303211120301 |
5 | 44022430123 |
6 | 4401004401 |
7 | 1111101322 |
oct | 263453061 |
9 | 107522341 |
10 | 47076913 |
11 | 24634644 |
12 | 13923701 |
13 | 99a3a80 |
14 | 6376449 |
15 | 41edaad |
hex | 2ce5631 |
47076913 has 16 divisors (see below), whose sum is σ = 52657360. Its totient is φ = 41803776.
The previous prime is 47076907. The next prime is 47076917. The reversal of 47076913 is 31967074.
47076913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 400689 + 46676224 = 633^2 + 6832^2 .
It is a cyclic number.
It is not a de Polignac number, because 47076913 - 25 = 47076881 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (47076917) 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 15 ways as a sum of consecutive naturals, for example, 46153 + ... + 47161.
It is an arithmetic number, because the mean of its divisors is an integer number (3291085).
Almost surely, 247076913 is an apocalyptic number.
It is an amenable number.
47076913 is a deficient number, since it is larger than the sum of its proper divisors (5580447).
47076913 is a wasteful number, since it uses less digits than its factorization.
47076913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156.
The product of its (nonzero) digits is 31752, while the sum is 37.
The square root of 47076913 is about 6861.2617644279. The cubic root of 47076913 is about 361.0793557945.
The spelling of 47076913 in words is "forty-seven million, seventy-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •