Base | Representation |
---|---|
bin | 10111011011001001110010… |
… | …001111011110011010100101 |
3 | 111111202201012202222012001001 |
4 | 113123021302033132122211 |
5 | 102000344003032034341 |
6 | 1003035110044433301 |
7 | 30462010321265110 |
oct | 2733116217363245 |
9 | 444681182865031 |
10 | 103021002221221 |
11 | 2a909a64002577 |
12 | b67a1b1248831 |
13 | 4563ab9b87986 |
14 | 1b62359159577 |
15 | bd9c2cc4dd31 |
hex | 5db2723de6a5 |
103021002221221 has 16 divisors (see below), whose sum is σ = 118894089790080. Its totient is φ = 87437896407360.
The previous prime is 103021002221201. The next prime is 103021002221233. The reversal of 103021002221221 is 122122200120301.
It is a cyclic number.
It is not a de Polignac number, because 103021002221221 - 215 = 103021002188453 is a prime.
It is a super-2 number, since 2×1030210022212212 (a number of 29 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 (103021002221201) 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, 41774266 + ... + 44171611.
It is an arithmetic number, because the mean of its divisors is an integer number (7430880611880).
Almost surely, 2103021002221221 is an apocalyptic number.
It is an amenable number.
103021002221221 is a deficient number, since it is larger than the sum of its proper divisors (15873087568859).
103021002221221 is a wasteful number, since it uses less digits than its factorization.
103021002221221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85947564.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 103021002221221 its reverse (122122200120301), we get a palindrome (225143202341522).
The spelling of 103021002221221 in words is "one hundred three trillion, twenty-one billion, two million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •