Base | Representation |
---|---|
bin | 10101011110110101000010… |
… | …01110110110100000010101 |
3 | 20012020222111002012021000010 |
4 | 22233122201032312200111 |
5 | 22142424432332041303 |
6 | 244245103513310433 |
7 | 12643613252214216 |
oct | 1257324116664025 |
9 | 205228432167003 |
10 | 47238755346453 |
11 | 14062930976a60 |
12 | 536b22b705419 |
13 | 2048798467608 |
14 | b9452196940d |
15 | 56dbc5e6ac03 |
hex | 2af6a13b6815 |
47238755346453 has 16 divisors (see below), whose sum is σ = 68755160932416. Its totient is φ = 28611113667840.
The previous prime is 47238755346451. The next prime is 47238755346463. The reversal of 47238755346453 is 35464355783274.
47238755346453 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 47238755346453 - 21 = 47238755346451 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47238755346451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 460823650 + ... + 460926147.
It is an arithmetic number, because the mean of its divisors is an integer number (4297197558276).
Almost surely, 247238755346453 is an apocalyptic number.
It is an amenable number.
47238755346453 is a deficient number, since it is larger than the sum of its proper divisors (21516405585963).
47238755346453 is a wasteful number, since it uses less digits than its factorization.
47238755346453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 921751364.
The product of its digits is 1016064000, while the sum is 66.
The spelling of 47238755346453 in words is "forty-seven trillion, two hundred thirty-eight billion, seven hundred fifty-five million, three hundred forty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •