Base | Representation |
---|---|
bin | 11000001101010100011100… |
… | …11111101111010011100001 |
3 | 20222111010210222221011122220 |
4 | 30012222032133233103201 |
5 | 23434142133112222041 |
6 | 305115243320421253 |
7 | 14133021324340521 |
oct | 1406521637572341 |
9 | 228433728834586 |
10 | 53234215351521 |
11 | 15a6455a830a86 |
12 | 5b79193017829 |
13 | 2391c71059479 |
14 | d2079a7db681 |
15 | 624b26564d66 |
hex | 306a8e7ef4e1 |
53234215351521 has 8 divisors (see below), whose sum is σ = 70995737681280. Its totient is φ = 35481084961392.
The previous prime is 53234215351519. The next prime is 53234215351571. The reversal of 53234215351521 is 12515351243235.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53234215351521 - 21 = 53234215351519 is a prime.
It is a super-2 number, since 2×532342153515212 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (53234215351571) 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, 2097970105 + ... + 2097995478.
It is an arithmetic number, because the mean of its divisors is an integer number (8874467210160).
Almost surely, 253234215351521 is an apocalyptic number.
It is an amenable number.
53234215351521 is a deficient number, since it is larger than the sum of its proper divisors (17761522329759).
53234215351521 is a wasteful number, since it uses less digits than its factorization.
53234215351521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4195969815.
The product of its digits is 540000, while the sum is 42.
Adding to 53234215351521 its reverse (12515351243235), we get a palindrome (65749566594756).
The spelling of 53234215351521 in words is "fifty-three trillion, two hundred thirty-four billion, two hundred fifteen million, three hundred fifty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •