Base | Representation |
---|---|
bin | 10111011110001110010011… |
… | …111001001100011011010101 |
3 | 111112111212212222112100102212 |
4 | 113132032103321030123111 |
5 | 102012323134133000341 |
6 | 1003320045124243205 |
7 | 30513160460450450 |
oct | 2736162371143325 |
9 | 445455788470385 |
10 | 103232020203221 |
11 | 2a9904aa173718 |
12 | b6b3082840505 |
13 | 457a978a59210 |
14 | 1b6c65666c497 |
15 | be047d6155eb |
hex | 5de393e4c6d5 |
103232020203221 has 16 divisors (see below), whose sum is σ = 127609618550400. Its totient is φ = 81321409055808.
The previous prime is 103232020203211. The next prime is 103232020203223. The reversal of 103232020203221 is 122302020232301.
It is a cyclic number.
It is not a de Polignac number, because 103232020203221 - 222 = 103232016008917 is a prime.
It is a super-3 number, since 3×1032320202032213 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103232020203223) 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, 2476873931 + ... + 2476915608.
It is an arithmetic number, because the mean of its divisors is an integer number (7975601159400).
Almost surely, 2103232020203221 is an apocalyptic number.
It is an amenable number.
103232020203221 is a deficient number, since it is larger than the sum of its proper divisors (24377598347179).
103232020203221 is a wasteful number, since it uses less digits than its factorization.
103232020203221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4953789788.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 103232020203221 its reverse (122302020232301), we get a palindrome (225534040435522).
The spelling of 103232020203221 in words is "one hundred three trillion, two hundred thirty-two billion, twenty million, two hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •