Base | Representation |
---|---|
bin | 101111100011001001… |
… | …1010100011101010001 |
3 | 100202120022020110201020 |
4 | 1133012103110131101 |
5 | 3133110431413410 |
6 | 114524221230053 |
7 | 10243260613524 |
oct | 1370623243521 |
9 | 322508213636 |
10 | 102111201105 |
11 | 3a33a124801 |
12 | 17958a02329 |
13 | 982401ca74 |
14 | 4d295c4bbb |
15 | 29c9765a70 |
hex | 17c64d4751 |
102111201105 has 16 divisors (see below), whose sum is σ = 165346332480. Its totient is φ = 53803170368.
The previous prime is 102111201089. The next prime is 102111201119. The reversal of 102111201105 is 501102111201.
It is a cyclic number.
It is not a de Polignac number, because 102111201105 - 24 = 102111201089 is a prime.
It is a super-2 number, since 2×1021112011052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 41007270 + ... + 41009759.
It is an arithmetic number, because the mean of its divisors is an integer number (10334145780).
Almost surely, 2102111201105 is an apocalyptic number.
102111201105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
102111201105 is a deficient number, since it is larger than the sum of its proper divisors (63235131375).
102111201105 is an equidigital number, since it uses as much as digits as its factorization.
102111201105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82017120.
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 102111201105 its reverse (501102111201), we get a palindrome (603213312306).
The spelling of 102111201105 in words is "one hundred two billion, one hundred eleven million, two hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •