Base | Representation |
---|---|
bin | 101111100011001001… |
… | …0100101110101001001 |
3 | 100202120021212202201202 |
4 | 1133012102211311021 |
5 | 3133110404310441 |
6 | 114524213153545 |
7 | 10243256156651 |
oct | 1370622456511 |
9 | 322507782652 |
10 | 102111010121 |
11 | 3a33a00426a |
12 | 1795892b8b5 |
13 | 9823c83b63 |
14 | 4d29575361 |
15 | 29c972919b |
hex | 17c64a5d49 |
102111010121 has 8 divisors (see below), whose sum is σ = 102214041600. Its totient is φ = 102008017440.
The previous prime is 102111010117. The next prime is 102111010181. The reversal of 102111010121 is 121010111201.
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 102111010121 - 22 = 102111010117 is a prime.
It is a super-4 number, since 4×1021110101214 (a number of 45 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102111010181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9665240 + ... + 9675798.
It is an arithmetic number, because the mean of its divisors is an integer number (12776755200).
Almost surely, 2102111010121 is an apocalyptic number.
It is an amenable number.
102111010121 is a deficient number, since it is larger than the sum of its proper divisors (103031479).
102111010121 is a wasteful number, since it uses less digits than its factorization.
102111010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19399.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102111010121 its reverse (121010111201), we get a palindrome (223121121322).
The spelling of 102111010121 in words is "one hundred two billion, one hundred eleven million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •