Base | Representation |
---|---|
bin | 101111100110001001… |
… | …1110101100101111001 |
3 | 100202211022220120222010 |
4 | 1133030103311211321 |
5 | 3133312233000441 |
6 | 114542221520133 |
7 | 10245623444310 |
oct | 1371423654571 |
9 | 322738816863 |
10 | 102212000121 |
11 | 3a391011580 |
12 | 17986713049 |
13 | 983bb8315a |
14 | 4d38b43277 |
15 | 29d3527116 |
hex | 17cc4f5979 |
102212000121 has 32 divisors (see below), whose sum is σ = 170144851968. Its totient is φ = 53024019840.
The previous prime is 102212000089. The next prime is 102212000201. The reversal of 102212000121 is 121000212201.
It is not a de Polignac number, because 102212000121 - 25 = 102212000089 is a prime.
It is a super-3 number, since 3×1022120001213 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102212000097 and 102212000106.
It is not an unprimeable number, because it can be changed into a prime (102212000321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136380 + ... + 472253.
It is an arithmetic number, because the mean of its divisors is an integer number (5317026624).
Almost surely, 2102212000121 is an apocalyptic number.
102212000121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102212000121 is a deficient number, since it is larger than the sum of its proper divisors (67932851847).
102212000121 is a wasteful number, since it uses less digits than its factorization.
102212000121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 609381.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102212000121 its reverse (121000212201), we get a palindrome (223212212322).
The spelling of 102212000121 in words is "one hundred two billion, two hundred twelve million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •