Base | Representation |
---|---|
bin | 101111100000011100… |
… | …0010000010011011001 |
3 | 100202022222001011021011 |
4 | 1133000320100103121 |
5 | 3132414134020441 |
6 | 114511211213521 |
7 | 10241104364041 |
oct | 1370070202331 |
9 | 322288034234 |
10 | 102020220121 |
11 | 3a2a2833406 |
12 | 179324472a1 |
13 | 980b216471 |
14 | 4d1b4a0721 |
15 | 29c1793581 |
hex | 17c0e104d9 |
102020220121 has 4 divisors (see below), whose sum is σ = 102068550144. Its totient is φ = 101971890100.
The previous prime is 102020220103. The next prime is 102020220143. The reversal of 102020220121 is 121022020201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 121022020201 = 157 ⋅770840893.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102020220121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102021220121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24161845 + ... + 24166066.
It is an arithmetic number, because the mean of its divisors is an integer number (25517137536).
Almost surely, 2102020220121 is an apocalyptic number.
It is an amenable number.
102020220121 is a deficient number, since it is larger than the sum of its proper divisors (48330023).
102020220121 is an equidigital number, since it uses as much as digits as its factorization.
102020220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48330022.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102020220121 its reverse (121022020201), we get a palindrome (223042240322).
The spelling of 102020220121 in words is "one hundred two billion, twenty million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •