Base | Representation |
---|---|
bin | 11110000101010110… |
… | …011011110111101001 |
3 | 10002101011221202001200 |
4 | 132011112123313221 |
5 | 1012123304201441 |
6 | 22501144234413 |
7 | 2222321441415 |
oct | 360526336751 |
9 | 102334852050 |
10 | 32302022121 |
11 | 12776716356 |
12 | 6315a6ba09 |
13 | 307a297775 |
14 | 17c6081d45 |
15 | c90c997b6 |
hex | 78559bde9 |
32302022121 has 6 divisors (see below), whose sum is σ = 46658476410. Its totient is φ = 21534681408.
The previous prime is 32302022117. The next prime is 32302022161. The reversal of 32302022121 is 12122020323.
It can be written as a sum of positive squares in only one way, i.e., 26805875625 + 5496146496 = 163725^2 + 74136^2 .
It is not a de Polignac number, because 32302022121 - 22 = 32302022117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32302022094 and 32302022103.
It is not an unprimeable number, because it can be changed into a prime (32302022161) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1794556776 + ... + 1794556793.
It is an arithmetic number, because the mean of its divisors is an integer number (7776412735).
Almost surely, 232302022121 is an apocalyptic number.
It is an amenable number.
32302022121 is a deficient number, since it is larger than the sum of its proper divisors (14356454289).
32302022121 is a wasteful number, since it uses less digits than its factorization.
32302022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3589113575 (or 3589113572 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 32302022121 its reverse (12122020323), we get a palindrome (44424042444).
It can be divided in two parts, 3230202 and 2121, that added together give a palindrome (3232323).
The spelling of 32302022121 in words is "thirty-two billion, three hundred two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •