Base | Representation |
---|---|
bin | 111100100001010100100100… |
… | …0011110001110011011110011 |
3 | 2120210212201002112200220002120 |
4 | 1321002221020132032123303 |
5 | 1024233421013440244021 |
6 | 5124112005033245323 |
7 | 220062450056546040 |
oct | 17102511036163363 |
9 | 2523781075626076 |
10 | 532345232353011 |
11 | 1446923884a7230 |
12 | 4b8580a5263843 |
13 | 19b06c2b27b30c |
14 | 956590a86c1c7 |
15 | 41827c3d9c2c6 |
hex | 1e42a4878e6f3 |
532345232353011 has 32 divisors (see below), whose sum is σ = 884949255479808. Its totient is φ = 276539313354240.
The previous prime is 532345232352931. The next prime is 532345232353043. The reversal of 532345232353011 is 110353232543235.
It is not a de Polignac number, because 532345232353011 - 29 = 532345232352499 is a prime.
It is a super-3 number, since 3×5323452323530113 (a number of 45 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (532345232353111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2244955 + ... + 32706731.
It is an arithmetic number, because the mean of its divisors is an integer number (27654664233744).
Almost surely, 2532345232353011 is an apocalyptic number.
532345232353011 is a deficient number, since it is larger than the sum of its proper divisors (352604023126797).
532345232353011 is a wasteful number, since it uses less digits than its factorization.
532345232353011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30537451.
The product of its (nonzero) digits is 972000, while the sum is 42.
Adding to 532345232353011 its reverse (110353232543235), we get a palindrome (642698464896246).
The spelling of 532345232353011 in words is "five hundred thirty-two trillion, three hundred forty-five billion, two hundred thirty-two million, three hundred fifty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •