Base | Representation |
---|---|
bin | 1110100110110100100100… |
… | …10100101010100011111001 |
3 | 11012201122220101022011012122 |
4 | 13103122102110222203321 |
5 | 13202224202401031413 |
6 | 152151454151051025 |
7 | 6523416001010000 |
oct | 723322224524371 |
9 | 135648811264178 |
10 | 32120220330233 |
11 | a264122005362 |
12 | 3729144970a75 |
13 | 14bcc017127a9 |
14 | 7d08ac537c37 |
15 | 3aa7c2280108 |
hex | 1d369252a8f9 |
32120220330233 has 20 divisors (see below), whose sum is σ = 37481096781348. Its totient is φ = 27524463996960.
The previous prime is 32120220330131. The next prime is 32120220330257. The reversal of 32120220330233 is 33203302202123.
It can be written as a sum of positive squares in 2 ways, for example, as 22096740314089 + 10023480016144 = 4700717^2 + 3165988^2 .
It is not a de Polignac number, because 32120220330233 - 218 = 32120220068089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32120220330733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7515023 + ... + 10987083.
Almost surely, 232120220330233 is an apocalyptic number.
It is an amenable number.
32120220330233 is a deficient number, since it is larger than the sum of its proper divisors (5360876451115).
32120220330233 is an frugal number, since it uses more digits than its factorization.
32120220330233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3475942 (or 3475921 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 32120220330233 its reverse (33203302202123), we get a palindrome (65323522532356).
The spelling of 32120220330233 in words is "thirty-two trillion, one hundred twenty billion, two hundred twenty million, three hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •