Base | Representation |
---|---|
bin | 111100100010000110010010… |
… | …0011100111000100110010101 |
3 | 2120211020220200112000022010001 |
4 | 1321010030210130320212111 |
5 | 1024242143200031012203 |
6 | 5124233023433531301 |
7 | 220103246656400431 |
oct | 17104144434704625 |
9 | 2524226615008101 |
10 | 532452002204053 |
11 | 144723698281648 |
12 | 4b874922273b31 |
13 | 19b140154b1979 |
14 | 956ab58a599c1 |
15 | 41854725dd91d |
hex | 1e44324738995 |
532452002204053 has 16 divisors (see below), whose sum is σ = 564241176720000. Its totient is φ = 501039411815232.
The previous prime is 532452002203999. The next prime is 532452002204069. The reversal of 532452002204053 is 350402200254235.
It is a cyclic number.
It is not a de Polignac number, because 532452002204053 - 237 = 532314563250581 is a prime.
It is a super-2 number, since 2×5324520022040532 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (532452002207053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 485333776 + ... + 486429622.
It is an arithmetic number, because the mean of its divisors is an integer number (35265073545000).
Almost surely, 2532452002204053 is an apocalyptic number.
It is an amenable number.
532452002204053 is a deficient number, since it is larger than the sum of its proper divisors (31789174515947).
532452002204053 is a wasteful number, since it uses less digits than its factorization.
532452002204053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1267644.
The product of its (nonzero) digits is 288000, while the sum is 37.
Adding to 532452002204053 its reverse (350402200254235), we get a palindrome (882854202458288).
The spelling of 532452002204053 in words is "five hundred thirty-two trillion, four hundred fifty-two billion, two million, two hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •