Base | Representation |
---|---|
bin | 111111010101001110000… |
… | …011001100001100000101 |
3 | 120102001120010021120122111 |
4 | 333111032003030030011 |
5 | 1032301111000030203 |
6 | 13131155441501021 |
7 | 626300242634434 |
oct | 77251603141405 |
9 | 16361503246574 |
10 | 4352111330053 |
11 | 14287a1428493 |
12 | 5a3575341771 |
13 | 25752cc20c86 |
14 | 11090136b11b |
15 | 7831d56326d |
hex | 3f54e0cc305 |
4352111330053 has 8 divisors (see below), whose sum is σ = 4361951006336. Its totient is φ = 4342281890400.
The previous prime is 4352111330023. The next prime is 4352111330087. The reversal of 4352111330053 is 3500331112534.
It is a happy number.
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 4352111330053 - 233 = 4343521395461 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4352111329997 and 4352111330024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4352111330023) 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, 1707576 + ... + 3408817.
It is an arithmetic number, because the mean of its divisors is an integer number (545243875792).
Almost surely, 24352111330053 is an apocalyptic number.
It is an amenable number.
4352111330053 is a deficient number, since it is larger than the sum of its proper divisors (9839676283).
4352111330053 is a wasteful number, since it uses less digits than its factorization.
4352111330053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5118315.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 4352111330053 its reverse (3500331112534), we get a palindrome (7852442442587).
The spelling of 4352111330053 in words is "four trillion, three hundred fifty-two billion, one hundred eleven million, three hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •