Base | Representation |
---|---|
bin | 10101100001100100000111… |
… | …00011011111001111111101 |
3 | 20012120222002111112202122201 |
4 | 22300302003203133033331 |
5 | 22200444431130022003 |
6 | 244400210314511501 |
7 | 12653451405546121 |
oct | 1260620343371775 |
9 | 205528074482581 |
10 | 47332746720253 |
11 | 1409978361a285 |
12 | 53854a1135591 |
13 | 20545c717ab27 |
14 | b98cba9b3581 |
15 | 571377916b1d |
hex | 2b0c838df3fd |
47332746720253 has 32 divisors (see below), whose sum is σ = 48188702048256. Its totient is φ = 46486647180288.
The previous prime is 47332746720247. The next prime is 47332746720277. The reversal of 47332746720253 is 35202764723374.
It is a cyclic number.
It is not a de Polignac number, because 47332746720253 - 213 = 47332746712061 is a prime.
It is a super-2 number, since 2×473327467202532 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47332746720194 and 47332746720203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47332746720653) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13210365700 + ... + 13210369282.
It is an arithmetic number, because the mean of its divisors is an integer number (1505896939008).
Almost surely, 247332746720253 is an apocalyptic number.
It is an amenable number.
47332746720253 is a deficient number, since it is larger than the sum of its proper divisors (855955328003).
47332746720253 is a wasteful number, since it uses less digits than its factorization.
47332746720253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6133.
The product of its (nonzero) digits is 35562240, while the sum is 55.
The spelling of 47332746720253 in words is "forty-seven trillion, three hundred thirty-two billion, seven hundred forty-six million, seven hundred twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •