Base | Representation |
---|---|
bin | 10111110000100111110000… |
… | …00110110001101101111111 |
3 | 20211222212121001001201010222 |
4 | 23320103320012301231333 |
5 | 23322013200021331443 |
6 | 303042244420451555 |
7 | 14001542506251524 |
oct | 1370237006615577 |
9 | 224885531051128 |
10 | 52248144714623 |
11 | 1571434a648820 |
12 | 5a3a059b49bbb |
13 | 231cc9586a120 |
14 | cc8b7632114b |
15 | 609162b2c468 |
hex | 2f84f81b1b7f |
52248144714623 has 8 divisors (see below), whose sum is σ = 61382435748816. Its totient is φ = 43844596963200.
The previous prime is 52248144714613. The next prime is 52248144714629. The reversal of 52248144714623 is 32641744184225.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52248144714623 - 236 = 52179425237887 is a prime.
It is a super-2 number, since 2×522481447146232 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52248144714629) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182685820538 + ... + 182685820823.
It is an arithmetic number, because the mean of its divisors is an integer number (7672804468602).
Almost surely, 252248144714623 is an apocalyptic number.
52248144714623 is a deficient number, since it is larger than the sum of its proper divisors (9134291034193).
52248144714623 is a wasteful number, since it uses less digits than its factorization.
52248144714623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365371641385.
The product of its digits is 10321920, while the sum is 53.
Adding to 52248144714623 its reverse (32641744184225), we get a palindrome (84889888898848).
The spelling of 52248144714623 in words is "fifty-two trillion, two hundred forty-eight billion, one hundred forty-four million, seven hundred fourteen thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •