Base | Representation |
---|---|
bin | 10111001101111010010010… |
… | …011111001001000001110001 |
3 | 111101112201100212022101100011 |
4 | 113031322102133021001301 |
5 | 101340441322043211311 |
6 | 1001101052300054521 |
7 | 30336164010201256 |
oct | 2715722237110161 |
9 | 441481325271304 |
10 | 102111010132081 |
11 | 2a599044211275 |
12 | b55196a834441 |
13 | 44c90472510b2 |
14 | 1b302b0aad42d |
15 | bc121d3c8321 |
hex | 5cde927c9071 |
102111010132081 has 2 divisors, whose sum is σ = 102111010132082. Its totient is φ = 102111010132080.
The previous prime is 102111010131961. The next prime is 102111010132099. The reversal of 102111010132081 is 180231010111201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84722452070400 + 17388558061681 = 9204480^2 + 4169959^2 .
It is a cyclic number.
It is not a de Polignac number, because 102111010132081 - 27 = 102111010131953 is a prime.
It is a super-2 number, since 2×1021110101320812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102111010132981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055505066040 + 51055505066041.
It is an arithmetic number, because the mean of its divisors is an integer number (51055505066041).
Almost surely, 2102111010132081 is an apocalyptic number.
It is an amenable number.
102111010132081 is a deficient number, since it is larger than the sum of its proper divisors (1).
102111010132081 is an equidigital number, since it uses as much as digits as its factorization.
102111010132081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 22.
Adding to 102111010132081 its reverse (180231010111201), we get a palindrome (282342020243282).
The spelling of 102111010132081 in words is "one hundred two trillion, one hundred eleven billion, ten million, one hundred thirty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •