Base | Representation |
---|---|
bin | 1011010001011… |
… | …1110001001001 |
3 | 10021222020110100 |
4 | 2310113301021 |
5 | 44101031043 |
6 | 4405240013 |
7 | 1112621052 |
oct | 264276111 |
9 | 107866410 |
10 | 47283273 |
11 | 24765694 |
12 | 13a03009 |
13 | 9a4698b |
14 | 63cb729 |
15 | 423ecd3 |
hex | 2d17c49 |
47283273 has 24 divisors (see below), whose sum is σ = 74007648. Its totient is φ = 28973952.
The previous prime is 47283259. The next prime is 47283281. The reversal of 47283273 is 37238274.
47283273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 47283273 - 25 = 47283241 is a prime.
It is not an unprimeable number, because it can be changed into a prime (47283293) 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 23 ways as a sum of consecutive naturals, for example, 2986 + ... + 10172.
It is an arithmetic number, because the mean of its divisors is an integer number (3083652).
Almost surely, 247283273 is an apocalyptic number.
47283273 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
47283273 is a deficient number, since it is larger than the sum of its proper divisors (26724375).
47283273 is a wasteful number, since it uses less digits than its factorization.
47283273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7253 (or 7250 counting only the distinct ones).
The product of its digits is 56448, while the sum is 36.
The square root of 47283273 is about 6876.2833711243. The cubic root of 47283273 is about 361.6061796763.
It can be divided in two parts, 4728 and 3273, that added together give a triangular number (8001 = T126).
The spelling of 47283273 in words is "forty-seven million, two hundred eighty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •