Base | Representation |
---|---|
bin | 101100000111001001… |
… | …010000000101100001 |
3 | 11112020220200012110020 |
4 | 230013021100011201 |
5 | 1234000303142303 |
6 | 33431533424053 |
7 | 3264510441432 |
oct | 540711200541 |
9 | 145226605406 |
10 | 47364505953 |
11 | 190a60353a6 |
12 | 921a33b029 |
13 | 460aa501ab |
14 | 24146cd489 |
15 | 1373302a53 |
hex | b07250161 |
47364505953 has 16 divisors (see below), whose sum is σ = 66876203520. Its totient is φ = 29715054336.
The previous prime is 47364505939. The next prime is 47364505967. The reversal of 47364505953 is 35950546374.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (47364505939) and next prime (47364505967).
It is not a de Polignac number, because 47364505953 - 25 = 47364505921 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 47364505896 and 47364505905.
It is not an unprimeable number, because it can be changed into a prime (47364509953) 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, 366603 + ... + 478671.
It is an arithmetic number, because the mean of its divisors is an integer number (4179762720).
Almost surely, 247364505953 is an apocalyptic number.
It is an amenable number.
47364505953 is a deficient number, since it is larger than the sum of its proper divisors (19511697567).
47364505953 is a wasteful number, since it uses less digits than its factorization.
47364505953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120376.
The product of its (nonzero) digits is 6804000, while the sum is 51.
The spelling of 47364505953 in words is "forty-seven billion, three hundred sixty-four million, five hundred five thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •