Base | Representation |
---|---|
bin | 1011011001010… |
… | …0111101000001 |
3 | 10022221021211110 |
4 | 2312110331001 |
5 | 44213433113 |
6 | 4424233533 |
7 | 1120155015 |
oct | 266247501 |
9 | 108837743 |
10 | 47796033 |
11 | 24a8595a |
12 | 1400b8a9 |
13 | 9b9619c |
14 | 64c2545 |
15 | 42e1bc3 |
hex | 2d94f41 |
47796033 has 4 divisors (see below), whose sum is σ = 63728048. Its totient is φ = 31864020.
The previous prime is 47796029. The next prime is 47796053. The reversal of 47796033 is 33069774.
47796033 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 a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 47796033 - 22 = 47796029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47795982 and 47796000.
It is not an unprimeable number, because it can be changed into a prime (47796053) 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, 7966003 + ... + 7966008.
It is an arithmetic number, because the mean of its divisors is an integer number (15932012).
Almost surely, 247796033 is an apocalyptic number.
It is an amenable number.
47796033 is a deficient number, since it is larger than the sum of its proper divisors (15932015).
47796033 is a wasteful number, since it uses less digits than its factorization.
47796033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15932014.
The product of its (nonzero) digits is 95256, while the sum is 39.
The square root of 47796033 is about 6913.4675091447. The cubic root of 47796033 is about 362.9086201542.
The spelling of 47796033 in words is "forty-seven million, seven hundred ninety-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •