Base | Representation |
---|---|
bin | 101111100000011011… |
… | …1110101111011111001 |
3 | 100202022221211200010011 |
4 | 1133000313311323321 |
5 | 3132414122041441 |
6 | 114511205021521 |
7 | 10241103434134 |
oct | 1370067657371 |
9 | 322287750104 |
10 | 102020112121 |
11 | 3a2a276a254 |
12 | 179323b48a1 |
13 | 980b1a9265 |
14 | 4d1b47321b |
15 | 29c1771581 |
hex | 17c0df5ef9 |
102020112121 has 8 divisors (see below), whose sum is σ = 104399174880. Its totient is φ = 99641344992.
The previous prime is 102020112109. The next prime is 102020112149. The reversal of 102020112121 is 121211020201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102020112121 - 215 = 102020079353 is a prime.
It is a super-2 number, since 2×1020201121212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102020118121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 723426 + ... + 852868.
It is an arithmetic number, because the mean of its divisors is an integer number (13049896860).
Almost surely, 2102020112121 is an apocalyptic number.
It is an amenable number.
102020112121 is a deficient number, since it is larger than the sum of its proper divisors (2379062759).
102020112121 is a wasteful number, since it uses less digits than its factorization.
102020112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147815.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102020112121 its reverse (121211020201), we get a palindrome (223231132322).
It can be divided in two parts, 1020201 and 12121, that multiplied together give a palindrome (12365856321).
The spelling of 102020112121 in words is "one hundred two billion, twenty million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •