Base | Representation |
---|---|
bin | 11000001000000110001000… |
… | …10101111011000111111011 |
3 | 20221211222112100210210101021 |
4 | 30010003010111323013323 |
5 | 23423222041402343343 |
6 | 304501001225203311 |
7 | 14114035446142261 |
oct | 1404030425730773 |
9 | 227758470723337 |
10 | 53054730121723 |
11 | 159a5426024320 |
12 | 5b4a441930537 |
13 | 237b068c6bb95 |
14 | d15c11120431 |
15 | 62011e1410ed |
hex | 3040c457b1fb |
53054730121723 has 8 divisors (see below), whose sum is σ = 57877992297216. Its totient is φ = 48231485428200.
The previous prime is 53054730121711. The next prime is 53054730121751. The reversal of 53054730121723 is 32712103745035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53054730121723 - 25 = 53054730121691 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53054730121723.
It is not an unprimeable number, because it can be changed into a prime (53054730121763) 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, 2435938 + ... + 10585048.
It is an arithmetic number, because the mean of its divisors is an integer number (7234749037152).
Almost surely, 253054730121723 is an apocalyptic number.
53054730121723 is a deficient number, since it is larger than the sum of its proper divisors (4823262175493).
53054730121723 is a wasteful number, since it uses less digits than its factorization.
53054730121723 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8740985.
The product of its (nonzero) digits is 529200, while the sum is 43.
Adding to 53054730121723 its reverse (32712103745035), we get a palindrome (85766833866758).
The spelling of 53054730121723 in words is "fifty-three trillion, fifty-four billion, seven hundred thirty million, one hundred twenty-one thousand, seven hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •